Cod sursa(job #530081)
Utilizator | Data | 6 februarie 2011 20:00:28 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream.h>
ifstream f("combinari.in");
ofstream g("combinari.out");
int m, n, k,x[51],i;
int main()
{f>>m>>n;
k=1;x[k]=0;
do {while(x[k]<m-n+k)
{x[k]++;//x[k]=1+x[k];
if(k==n){for(i=1;i<=n;i++)g<<x[i]<<" ";
g<<"\n";
}
else {k++;x[k]=x[k-1];}
}
k--;
}while(k);g.close();
return 0;
}