Cod sursa(job #1753444)
| Utilizator | Data | 6 septembrie 2016 16:00:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,st[20],p;
void afisare(){
for(int i=1; i<=k; i++){
fout<<st[i]<<" ";
}
fout<<endl;
}
void back1(int p){
if(p==k+1){
afisare();
}
for(int val=st[p-1]+1; val<=n; val++){
st[p]=val;
back1(p+1);
}
}
int main()
{
fin>>n>>k;
back1(1);
return 0;
}
