Pagini recente » Cod sursa (job #2983524) | Cod sursa (job #371851) | Cod sursa (job #2752635) | Cod sursa (job #2067815) | Cod sursa (job #1130115)
#include<cstdio>
using namespace std;
int i,n,k,v[30];
bool sem[30];
void afisare()
{
for(int j=1;j<=k;++j) printf("%d",v[j]);
printf("\n");
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
i=1;
while(i)
{
++v[i];
if(v[i]<=n&&i<=k)
{
if(!sem[v[i]])
{
sem[v[i]]=true;
if(i==k) afisare();
v[++i]=0;
}
}
else sem[v[--i]]=false;
}
return 0;
}