Cod sursa(job #793274)
| Utilizator | Data | 2 octombrie 2012 13:56:35 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <cstdio>
using namespace std;
FILE *fin=freopen("combinari.in","r",stdin);
FILE *fout=freopen("combinari.out","w",stdout);
int n,k;
int sol[20];
void afisare()
{
for (int i=1;i<=k;i++)
scanf("%d", sol[i]);
printf("\n");
}
void bec(int p)
{
if(p>k)
{
afisare();
return ;
}
for(int i=sol[p-1]+1;i<=n;i++)
{
sol[p]=i;
bec(p+1);
}
}
int main()
{
scanf("%d %d",&n,&k);
bec(1);
return 0;
}
