Cod sursa(job #1839536)
Utilizator | Data | 3 ianuarie 2017 00:28:19 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <cstdio>
using namespace std;
int a[20],n,k;
void bak(int p)
{
for(int i=1;i<=n;i++)
{
a[p]=i;
if(a[p]>a[p-1])
{
if(p==k)
{
for(int i=1;i<=k;i++)
cout<<a[i]<<" ";
cout<<"\n";
}
else
bak(p+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
cin>>n>>k;
bak(1);
return 0;
}