Cod sursa(job #1528361)
| Utilizator | Data | 19 noiembrie 2015 15:44:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
int a[100],n,k;
ifstream cin ("combinari.in");
ofstream cout ("combinari.out");
void afisare()
{
for(int i=1;i<=k;++i)
{
cout<<a[i]<<" ";
}
cout<<"\n";
}
void b(int pos)
{
if(pos==k+1) afisare();
else
{
for(int i=a[pos-1]+1;i<=n;i++)
{
a[pos]=i;
b(pos+1);
}
}
}
int main()
{
cin>>n>>k;
b(1);
}
