Pagini recente » Cod sursa (job #959604) | Cod sursa (job #27357) | Cod sursa (job #270880) | Cod sursa (job #2636920) | Cod sursa (job #349589)
Cod sursa(job #349589)
#include<iostream>
#define nmax 20
using namespace std;
int n,j,x,y,k;
int v[nmax];
void write()
{
for(x=1;x<=k;x++)
cout<<v[x];
cout<<"\n";
}
void solve(int i)
{
int j=1;
if(i<=k)
{
for(j=v[i-1]+1;j<=n&&v[i-1]+1<=n;j++)
{
v[i]=j;
solve(i+1);
}
}
else write();
}
int main()
{
//freopen("combinari.in", "r", stdin);
//freopen("combinari.out", "w", stdout);
cin>>n>>k;
solve(1);
return 0;
}