Pagini recente » Cod sursa (job #2668511) | Cod sursa (job #324933) | Cod sursa (job #1282908) | Cod sursa (job #1748977) | Cod sursa (job #1732509)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,sol[19];
int ok(int k)
{
for(int i=1;i<k;i++)
if(sol[i]==sol[k])
return 0;
return 1;
}
void back(int k)
{
if(k>m)
{
for(int i=1;i<=m;i++)
g<<sol[i]<<" ";
g<<"\n";
}
else
{
for(int i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
if(ok(k))
back(k+1);
}
}
}
int main()
{
f>>n>>m;
back(1);
}