Pagini recente » Cod sursa (job #53947) | Cod sursa (job #2109264) | Cod sursa (job #2296474) | Cod sursa (job #1327829) | Cod sursa (job #1234797)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, s[19];
void a ()
{
for(int i=1; i<=n; ++i)
cout<<s[i]<<" ";
cout<<'\n';
}
bool b (int k)
{
for (int i=1; i<=k; ++i)
{
if(s[k] <= s[i])
return false;
}
return true;
}
void c (int k)
{
if(k == k+1) a();
else
{
for(int i=1; i<=n; i++)
{
s[k] = i;
if (b(k)) c(k+1);
}
}
}
int main()
{
cin>>n>>m;
c(1);
}