Cod sursa(job #1966505)
| Utilizator | Data | 15 aprilie 2017 12:30:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,v[20];
void backtracking( int p, int k, int n ){
int i;
if( p == k + 1 ){
for( i = 1; i <= k; i ++ ){
out << v[i]<<" ";
}
out <<"\n";
}
else{
for( i = v[p-1] + 1; i <= n; i ++ ){
v[p] = i;
backtracking( p + 1 , k, n);
}
}
}
int main(){
in >> n >> k;
backtracking( 1, k ,n);
return 0;
}
