Cod sursa(job #1892774)
Utilizator | Data | 25 februarie 2017 11:44:13 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int n, k, w[20];
void bkt(int pos){
int i;
if(pos==k){
for(i=1; i<=k; i++)
cout<<w[i]<<" ";
cout<<endl;
}
else {
for(i=w[pos]+1; i<=n; i++){
w[pos+1]=i;
bkt(pos+1);
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
cin>>n>>k;
bkt(0);
return 0;
}