Cod sursa(job #1607824)
Utilizator | Data | 21 februarie 2016 17:07:56 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,v[19];
void inapoi(int l)
{
int i;
if(l==k)
{
for(i=1;i<=k;i++)
{
g<<v[i]<<" ";
}
g<<"\n";
}
else
{
for(i=v[l]+1;i<=n;i++)
{
v[l+1]=i;
inapoi(l+1);
}
}
}
int main()
{
f>>n>>k;
/*for(i=1;i<=n;i++)
{
v[i]=i;
}*/
inapoi(0);
return 0;
}