Cod sursa(job #1401459)
| Utilizator | Data | 25 martie 2015 21:50:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
#define nmax 205
using namespace std;
int n, k;
int sol[nmax];
ifstream fin("combinari.in");
ofstream fout ("combinari.out");
void backtrack(int x){
if(x== k){
for(int i=0; i<k; i++) fout << sol[i] << " ";
fout << "\n";
}
for(int i=sol[x-1]+1; i<=n; i++){
sol[x]= i;
backtrack(x+1);
}
}
int main(){
fin.sync_with_stdio(false);
fin >> n >> k;
backtrack(0);
return 0;
}
