Cod sursa(job #1813962)
Utilizator | Data | 23 noiembrie 2016 15:42:20 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <bits/stdc++.h>
using namespace std;
int n,k;
int a[20];
void Print(){
for(int i=1;i<=k;i++) out << a[i] << ' ';
out << '\n';
}
void Back(int val, int pos){
a[pos]=val;
if(pos==k) Print();
else{
for(int i=val+1;i<=n;i++) Back(i,pos+1);
}
}
int main(){
ifstream in("combinari.in");
ofstream out("combinari.out");
in >> n >> k;
Back(0,0);
}