Pagini recente » Cod sursa (job #2383789) | simulare-cartita-02 | Cod sursa (job #340595) | Cod sursa (job #2307527) | Cod sursa (job #952346)
Cod sursa(job #952346)
#include<cstdio>
#include<iostream>
#include<fstream>
using namespace std;
int a[19],b[19],n;
void back(int k,int len,int max)
{
if(k-1 == max)
{
for(int i = 1; i <= max;i++)
cout<<a[i];
cout<<n;
}
else
{
for(int i = 1; i <= len; i++)
if(!b[i] && a[k-1] < i)
{
a[k] = i;
b[i] = 1;
back(k+1,len,max);
b[i] = 0;
}
}
}
int main()
{
fstream cin("combinari.in");ofstream cout("combinari.out");
int n,k;
cin>>n>>k;
back(1,n,k);
return 0;
}