Cod sursa(job #787110)
Utilizator | Data | 12 septembrie 2012 17:03:32 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<iostream>
#include<fstream>
using namespace std;
int n,v[10],k;
ofstream fout("combinari.out");
void out()
{
for(int i=1;i<=k;++i)
fout<<v[i]<<' ';
fout<<'\n';
}
void back(int p)
{
if(p>k)
{
out();
return;
}
for(int i=v[p-1]+1;i<=n;++i)
{
v[p]=i;
back(p+1);
}
}
int main()
{
ifstream fin("combinari.in");
fin>>n;
fin>>k;
back(1);
return 0;
}