Cod sursa(job #1640429)
Utilizator | Data | 8 martie 2016 17:27:57 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <cstdio>
using namespace std;
int v[25],n,k;
void back(int poz)
{
if(poz==k+1)
{
for(int i=1;i<=k;i++) printf("%d ",v[i]);
printf("\n");
}
else
{
for(int i=v[poz-1]+1;i<=n;i++)
{
v[poz]=i;
back(poz+1);
}
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d",&n,&k);
back(1);
return 0;
}