Cod sursa(job #407118)
Utilizator | Data | 2 martie 2010 07:51:49 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int k,s[20],n,i,m;
int main()
{ f>>n>>m;
k=1;s[k]=0;
while (k>0)
{ if (s[k]<n-m+k)
{s[k]++;
if (k<m)
{k++; s[k]=s[k-1];}
else
{ for(i=1;i<=m;i++)
g<<s[i]<<" ";
g<<'\n';
}
}
else
k--;
}
return 0;
}