Cod sursa(job #1992803)
Utilizator | Data | 21 iunie 2017 15:07:37 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int v[19]={0};
int n,k;
void afisare()
{ int i;
for(i=1;i<=k;i++)
out<<v[i]<<" "; out<<endl;
}
void bk(int j)
{ int i;
for(i=v[j-1]+1;i<=n;i++)
{
v[j]=i;
if(j==k) afisare();
else bk(j+1);
}
}
int main()
{
in>>n>>k;
bk(1);
}