Cod sursa(job #2028078)
| Utilizator | Data | 27 septembrie 2017 09:43:05 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,per[50],y[50];
void afisare()
{
for(int i=1;i<=k;i=i+1){
g<<per[i]<<" ";
}
g<<"\n";
}
void bktr(int pas)
{
if(pas>k){
afisare();
}
else{
for(int i=per[pas-1]+1;i<=n;i++){
{
per[pas]=i;
bktr(pas+1);
}
}
}
}
int main()
{
f>>n>>k;
bktr(1);
return 0;
}
