Cod sursa(job #2508938)
Utilizator | Data | 13 decembrie 2019 15:16:30 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,c[20];
void bkt(int);
int main()
{
f>>n>>k;
bkt(1);
return 0;
}
void bkt(int i)
{
if(i==k+1)
{
for(int j=1;j<=k;j++)
g<<c[j]<<' ';
g<<'\n';
return;
}
for(int j=c[i-1]+1;j<=n;j++)
{
c[i]=j;
bkt(i+1);
}
}