Cod sursa(job #1198270)
Utilizator | Data | 15 iunie 2014 11:40:55 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,k,x[101];
void afis()
{ int i;
for(i=1;i<=n;i++) g<<x[i]<<" ";
g<<"\n";
}
int main()
{ f>>m>>n; f.close();
k=1; x[k]=0;
do
{ while(1+x[k]<=m-n+k)
{ x[k]++;
if(k==n) afis();
else k++, x[k]=x[k-1];
}
k--;
}
while(k>0);
g.close();
return 0;
}