Cod sursa(job #1497439)
| Utilizator | Data | 6 octombrie 2015 20:12:07 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int st[100], n, k;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afisare(int p)
{
for(int i=1; i<=p; i++)
fout<<st[i]<<" ";
fout<<'\n';
}
void back(int p)
{
for(int 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;
}
