Cod sursa(job #1415314)
Utilizator | Data | 4 aprilie 2015 11:15:56 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int n, x[20], K;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void back(int k){
int i;
if(k > K){
for(i=1;i<=K;i++){
fout<<x[i]<<" ";
}
fout<<"\n";
}else{
for(i=x[k-1]+1;i<=n;i++){
x[k] = i;
back(k+1);
}
}
}
int main(){
fin>>n>>K;
back(1);
}