Cod sursa(job #1014891)
Utilizator | Data | 23 octombrie 2013 17:21:24 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k;
int sol[20];
void combinari(int p)
{
if(p==k+1) { for(int i=1;i<=k;i++)
g<<sol[i]<<" ";
g<<endl;}
else
for(int i=sol[p-1]+1;i<=n-k+p;i++)
{
sol[p]=i;
combinari(p+1);
}
}
int main()
{
f>>n;
f>>k;
combinari(1);
return 0;
}