Cod sursa(job #558099)
Utilizator | Ioo Andrei Rares swxx | Data | 17 martie 2011 08:42:39 |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
// Combinari
#include<iostream>
#include<fstream>
using namespace std;
long n,i,k,st[100000];
void afisare()
{
ofstream g("combinari.out");
for(i=1;i<=k;i++)
g<< st[i]<<" ";
g<<endl;
g.close();
}
void back (int p)
{
int pval;
for(pval=st[p-1]+1;pval<=n;pval++)
{ st[p]=pval;
if(p==k) afisare();
else back (p+1);
}
}
int main()
{
ifstream f ("combinari.in");
f>>n>>k;
back(1);
return 0;
}