Cod sursa(job #159584)
Utilizator | Data | 14 martie 2008 11:30:35 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream.h>
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[100],k,m,n;
void afisare()
{
for(int i=1;i<=m;i++)
g<<x[i]<<" ";
g<<'\n';
}
int main()
{
f>>n>>m;
k=1;
x[k]=0;
while(k>0)
{
if(x[k]<n-m+k)
{
x[k]++;
if(k==m)
afisare();
else
{
k++;
x[k]=x[k-1];
}
}
else
k--;
}
f.close();
g.close();
return 0;
}