Cod sursa(job #370248)
Utilizator | Data | 30 noiembrie 2009 17:14:45 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream.h>
int n,k,t,u,x[20],i;
int main()
{
ifstream f("combinari.in");
ofstream g("combinari.out");
f>>n>>t;
k++;
while(k)
{
x[k]++;
if(k==t)
{
for(i=1;i<=t;i++)g<<x[i]<<' ';
g<<'\n';
u=0;
while(x[k-u]==n-u)u++;
k-=u;
}
else
{
k++;
x[k]=x[k-1];
}
}
return 0;
}