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