Cod sursa(job #154213)
Utilizator | Alexandru Vlad p1ccolino | Data | 10 martie 2008 23:42:27 |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream.h>
short int n,c,x[19];
ofstream g("combinari.out");
int verif(int k)
{int i;
for(i=1;i<k;i++) if(x[k]<=x[i]) return 0;
return 1;
}
void back(int k)
{int i;for(i=1;i<n+1;i++)
{x[k]=i;if (verif(k)) if(k==c){int j;
for(j=1;j<c+1;j++)
g<<x[j]<<" ";
g<<"\n";}
else back(k+1);
}
}
int main()
{ifstream f("combinari.in");
f>>n>>c;f.close();
back(1);
g.close();
return 0;
}