Cod sursa(job #741044)
Utilizator | Data | 25 aprilie 2012 10:51:30 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<stdio.h>
int v[20],n,t;
void back ( int k )
{
if(k>t)
{
for(register int i=1; i<=t; ++i )
printf("%d ",v[i]);
printf("\n");
}
else
{
if(v[k-1]!=n)
for(register int i=v[k-1]+1 ; i<= n; ++i)
{
v[k]=i;
back(k+1);
}
}
}
int main ()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&t);
back ( 1 );
return 0;
}