Cod sursa(job #380739)
| Utilizator | Data | 7 ianuarie 2010 16:01:33 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
#include <iostream>
using namespace std;
int x[20],n,k;
ofstream fout("combinari.out");
void back(int j){
for(int i = x[j-1]+1 ; i<=n ; i++){
x[j] = i;
if(j == k){
for(int p=1;p<=k;p++)
fout<<x[p]<<" ";
fout<<"\n";
}
else
back(j+1);
}
}
int main(){
ifstream fin("combinari.in"); fin>>n>>k; fin.close();
back(1);
}
