Cod sursa(job #1318317)
| Utilizator | Data | 15 ianuarie 2015 20:38:14 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,v[10];
void afisare(int p)
{
for(int i=1;i<=p;++i)
g<<v[i]<<" ";
g<<"\n";
}
void bk(int p)
{
int pval;
for(pval=v[p-1]+1;pval<=n;++pval)
{
v[p]=pval;
if(p==k) afisare(p);
else bk(p+1);
}
}
int main()
{
f>>n>>k;
bk(1);
f.close();
g.close();
return 0;
}
