Cod sursa(job #1295389)
Utilizator | Data | 19 decembrie 2014 13:17:24 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int n, k, x[20];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void sol(int k){
for(int i = 1; i <= k; i++){
fout<< x[i] <<" ";
}
fout<<"\n";
}
void back(int p){
if(p == k + 1){
sol(k);
}
else{
for(int i = x[p-1] + 1; i <= n; i++){
x[p] = i;
back(p+1);
}
}
}
int main(){
fin>> n >> k;
back(1);
}