Cod sursa(job #1910472)
Utilizator | Data | 7 martie 2017 17:06:59 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#define N 20
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n, k, v[N];
void c(int z){
if(z>k){
for(int i=1; i<=k; i++)out<<v[i]<<" ";
out<<"\n";
return;
}
for(int i=1; i<=n; i++){
if(i>v[z-1])v[z]=i,c(z+1);
}
}
int main(){
in>>n>>k;
c(1);
return 0;
}