Cod sursa(job #521872)
Utilizator | Data | 13 ianuarie 2011 17:39:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int m,n,k,x[21],i;
int main()
{f>>m>>n;
k=1;x[k]=0;
do{
while(x[k]<m-n+k)
{x[k]++;
if(k==n)
{for(i=1;i<=n;++i) g<<x[i]<<' ';
g<<"\n";}
else {k+=1; x[k]=x[k-1];}
}
k--;
}while(k);
g.close(); return 0;
}