Pagini recente » Cod sursa (job #2461841) | Cod sursa (job #2928982) | Cod sursa (job #2462563) | Cod sursa (job #1594735) | Cod sursa (job #621893)
Cod sursa(job #621893)
#include<cstdio>
int N,C,X[19];
void afis()
{ int i;
for(i=1;i<=C;i++)
printf("%d",X[i]);
printf("\n");
}
bool continuare(int k)
{
if ( (X[k]>X[k-1]) && (X[k]<=N) )
return 1;
return 0;
}
void back(int k)
{
if(k>0)
if(k>C)
{
afis();
back(k-1);
}
else
{
X[k]++;
if(continuare(k))
back(k+1);
else
if(X[k]>=N)
{
X[k]=0;
back(k-1);
}
else
back(k);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&N,&C);
back(1);
return 0;
}