Cod sursa(job #1348739)
Utilizator | Data | 19 februarie 2015 20:46:48 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream x ("combinari.in");
ofstream y ("combinari.out");
int n,k;
int v[19];
void gen(int i, int v[])
{
int j;
if(i==k)
{
for(j=1;j<=k;j++)
y<<v[j]<<' ';
y<<'\n';
}
else
{
i++;
for(j=v[i-1]+1;j<=n-k+i;j++)
{
v[i]=j;
gen(i,v);
}
}
}
int main()
{
x>>n>>k;
gen(0,v);
return 0;
}