Cod sursa(job #1337870)
| Utilizator | Data | 9 februarie 2015 16:40:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
//combinari
#include<fstream>
#include<iostream>
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)
{
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;
fin>>k;
back(1);
return 0;}
