Cod sursa(job #1135098)
Utilizator | Data | 7 martie 2014 12:18:37 | |
---|---|---|---|
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 m,n,x[19];
void afis()
{
for(int i=1; i<=n; i++) g << x[i] << " ";
g << '\n';
}
void back(int k)
{ if(k > n) afis();
else for( x[k]=x[k-1]+1; x[k]<=m-n+k; x[k]++) back(k+1);
}
int main()
{
f >> m >> n;
back(1);
g.close();
return 0;
}