Cod sursa(job #1708130)
Utilizator | Data | 26 mai 2016 17:46:10 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,k,i[30];
void back(int niv) {
if(niv>k){
for(int w=1;w<=k;w++) out<<i[w]<<' '; out<<'\n';
return;
}
for(i[niv]=i[niv-1]+1;i[niv]<=n;i[niv]++)
back(niv+1);
}
int main()
{ in>>n>>k;
back(1);
}