Pagini recente » Cod sursa (job #2906067) | Cod sursa (job #1738537) | Cod sursa (job #448948) | Cod sursa (job #462652) | Cod sursa (job #793375)
Cod sursa(job #793375)
#include <cstdio>
using namespace std;
int sol[19];
int n,p;
void afis()
{
for(int i = 0; i < p;i++)
{
printf("%d", sol[i]);
}
printf("\n");
}
int viz[10];
void back(int k)
{
if (k == p)
{
afis();
return;
}
for( int v = ( k==0 )? 1 : sol[k - 1] + 1; v <= n; v++ )
{
sol[k] =v;
back(k+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&p);
back(0);
return 0;
}