Cod sursa(job #1337869)
Utilizator | Peter Daiana daianapeter | Data | 9 februarie 2015 16:39:40 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[100],n,i,k;
void afisare(int p)
{
for(i=1;i<=p;++i)
fout<<st[i]<<" ";
fout<<"\n";
}
void back(int p)
{
int pval;
for(pval=st[p-1]+1;pval<=n;++pval)
{
st[p]=pval;
if(p==k) afisare(p);
else back(p+1);
}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}