Cod sursa(job #1942132)
Utilizator | Data | 27 martie 2017 20:18:53 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include<fstream>
#include<cmath>
#include<algorithm>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k;
int v[30];
void p(int poz,int st)
{
int i,d,h,r,l;
if(poz==k)
{
for(i=1; i<=k; i++)
fout<<v[i]<<' ';
fout<<'\n';
return;
}
for(i=st;i<=n;i++)
{
v[poz+1]=i;
p(poz+1,i+1);
}
}
int main()
{
fin>>n>>k;
p(0,1);
}