Cod sursa(job #1393938)
| Utilizator | Data | 19 martie 2015 21:16:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,v[20];
void citire()
{
fin>>n>>k;
}
void afisare()
{
for(int a1=1;a1<=k;a1++)
{
fout<<v[a1]<<" ";
}
fout<<'\n';
}
int back1(int x,int pre)
{
x++;
if(x<=k)
{
for(int a1=pre+1;a1<=n-k+x;a1++)
{
v[x]=a1;
back1(x,a1);
}
}
else
{
afisare();
}
}
int main()
{
citire();
back1(0,0);
}
