Cod sursa(job #2460946)
| Utilizator | Data | 24 septembrie 2019 18:39:59 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
#define NMAX 15
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int sol[NMAX];
int N,K;
void bkt(int k)
{
if(k==K+1)
{
for(int i=1;i<=K;++i)
fout<<sol[i]<<" ";
fout<<"\n";
}
else{
for(int i=sol[k-1]+1;i<=N;++i)
{
sol[k]=i;
bkt(k+1);
}
}
}
int main()
{
fin>>N>>K;
bkt(1);
return 0;
}
