Cod sursa(job #960485)
Utilizator | Data | 10 iunie 2013 16:12:47 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[20];
int n,k;
void afisare(){
for(int i=1;i<=k;i++) out<<v[i]<<' ';
out<<'\n';
}
void back(int x){
if(x>k) afisare();
else for(v[x]=v[x-1]+1;v[x]<=n;v[x]++) back(x+1);
}
int main(){
in>>n>>k;
back(1);
return 0;
}