Cod sursa(job #903046)
Utilizator | Lungu Cosmin lungu9 | Data | 1 martie 2013 18:14:53 |
---|---|---|---|
Problema | Deque | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,a[100],pus[100];
void afisare()
{
int i;
for(i=1;i<=k;i++)
g<<a[i]<<" ";
g<<endl;
}
int genereaza(int p)
{
for(int i=a[p-1]+1;i<=n-k+p;i++)
{
a[p]=i;
pus[i]=1;
if(p==k)
afisare();
else genereaza(p+1);
}
}
int main()
{
f>>n>>k;
genereaza(1);
return 0;
}