Cod sursa(job #1312277)
Utilizator | Data | 9 ianuarie 2015 08:44:29 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m, k,x[19];
void afis()
{
for(int i=1;i<=n;i++)
g<<x[i]<<" ";
g<<'\n';
}
void back()
{
k=1;x[k]=0;
do{
while(x[k]<m-n+k)
{
x[k]++;
if(k==n) afis();
else
{k++; x[k]=x[k-1];}
}
k--;
}while(k>0);
}
int main()
{
f>>m>>n;
back();
g.close(); return 0;
}