Pagini recente » Cod sursa (job #2470393) | Cod sursa (job #3129950) | Cod sursa (job #2351192) | Cod sursa (job #1346394) | Cod sursa (job #547650)
Cod sursa(job #547650)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,q,x[20];
void afis(int k)
{
for(int i=1;i<=q;i++)
g<<x[i]<<" ";
g<<"\n";
}
int valid(int k)
{
for(int i=1;i<k;i++)
{
if(x[k]==x[i]) return 0;
if(x[i]>x[i+1]) return 0;
}
return 1;
}
void back(int k)
{
for(int i=1;i<=n;i++)
{
x[k]=i;
if(valid(k))
if(k==q) afis(k);
else
back(k+1);
}
}
int main()
{
f>>n>>q;
back(1);
return 0;
}