Pagini recente » Cod sursa (job #2359098) | Cod sursa (job #289849) | Cod sursa (job #140940) | Cod sursa (job #486656) | Cod sursa (job #748468)
Cod sursa(job #748468)
#include<fstream>
using namespace std;
short x[20],n;
bool bun(int a)
{
for(int i=1;i<a;i++)
if(x[i]==x[a])
return 0;
return 1;
}
int main()
{
ifstream cin("combinari.in");ofstream cout("combinari.out");
int k,i=1,j;
cin>>n>>k;
while(i)
{
while(i&&i<=k)
{
x[i]++;
if(x[i]>n)
x[i--]=0;
else
{
if(x[i-1]>x[i])
x[i--]++;
if(bun(i))
i++;
}
}
if(i>k)
{
i=k;
for(j=1;j<=k;j++)
cout<<x[j];
cout<<'\n';
}
}
}