Cod sursa(job #1886308)
Utilizator | Data | 20 februarie 2017 20:13:35 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
#define NMax 20
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int N,K;
int x[NMax];
void Back(int k)
{
if(k>K)
{
for(int i=1;i<=K;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
else for(int i=x[k-1]+1;i<=N;i++)
{
x[k]=i;
Back(k+1);
}
}
int main()
{
fin>>N>>K;
Back(1);
return 0;
}