Cod sursa(job #2197945)
Utilizator | Data | 23 aprilie 2018 10:24:29 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <fstream>
#define N 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,K;
int x[N];
void Write()
{int i;
for(i=1;i<=K;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void Back(int k)
{int i;
for(i=x[k-1]+1;i<=n-K+k;i++)
{x[k]=i;
if(k==K) Write();
else Back(k+1);
}
}
int main()
{fin>>n>>K;
Back(1);
fin.close();
fout.close();
return 0;
}