Pagini recente » Cod sursa (job #2183120) | Cod sursa (job #401796) | Cod sursa (job #1743778) | Cod sursa (job #239346) | Cod sursa (job #547654)
Cod sursa(job #547654)
#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";
}
void back(int k)
{
for(int i=1;i<=n;i++)
{
x[k]=i;
if(x[k]>x[k-1])
if(k==q) afis(k);
else
back(k+1);
}
}
int main()
{
f>>n>>q;
back(1);
return 0;
}