Cod sursa(job #1414685)
Utilizator | Data | 2 aprilie 2015 21:24:13 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream cin("combinari.in");
ofstream cout("combinari.out");
int n,k,comb,a[40];
void afisez()
{
for (int i=1; i<=comb; ++i) cout<<a[i]<<" ";
cout<<"\n";
}
void back(int k)
{
if (k>comb) afisez();
else
for (int i=a[k-1]+1; i<=n; ++i)
{a[k]=i;
back(k+1);
}
}
int main()
{
cin>>n>>comb;
back(1);
return 0;
}