Pagini recente » Cod sursa (job #370810) | Cod sursa (job #2394848) | Cod sursa (job #2145825) | Cod sursa (job #2372025) | Cod sursa (job #2119614)
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int n,m,sol[20];
bool ok (int k)
{
for (int i=1;i<k;i++)
{
if (sol[k]==sol[i]) return false;
}
return true;
}
void afis ()
{
for (int i=1;i<=m;i++)
{
g<<sol[i]<<" ";
}
g<<'\n';
}
void Back (int k)
{
int i;
if (k>m) afis();
else
{
for (i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
if (ok(k)) Back(k+1);
}
}
}
int main()
{
f>>n>>m;
Back(1);
return 0;
}