Cod sursa(job #552277)
| Utilizator | Data | 11 martie 2011 23:34:33 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
int n,k,v[25];
ofstream g("combinari.out");
int rec(int x,int nr)
{
int i;
v[nr]=x;
if(nr==k)
{
for(i=1;i<=k;i++)
g<<v[i]<<" ";
g<<'\n';
return 0;
}
if(nr<k)
for(i=x+1;i<=n;i++)
rec(i,nr+1);
return 0;
}
int main()
{
int i;
ifstream f("combinari.in");
f>>n>>k;
for(i=1;i<=n-k+1;i++)
rec(i,1);
}