Cod sursa(job #711234)
| Utilizator | Data | 11 martie 2012 18:24:01 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,i,m,stiva[19];
void recursiv(int k)
{ for(stiva[k]=stiva[k-1]+1;stiva[k]<=n ;++stiva[k])
if (k==m)
{ for (i=1;i<=m;++i)
fout << stiva[i] << " ";
fout << '\n';
}
else
recursiv(k+1);
}
int main()
{ fin >> n >> m;
recursiv(1);
return 0;
}
