Cod sursa(job #1172746)
Utilizator | Data | 17 aprilie 2014 23:33:09 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
#define MAX 20
int sol[MAX], n, k;
void back(int i)
{
if(i==k+1){
for(int j=1; j<=k; j++)
fout<<sol[j]<<' ';
fout<<'\n';
}
else
for(int j=sol[i-1]+1; j<=n; j++){
sol[i] = j;
back(i+1);
}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}