Pagini recente » Cod sursa (job #1651446) | Cod sursa (job #1198957) | Cod sursa (job #366052) | Cod sursa (job #3120946) | Cod sursa (job #1637397)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[100],sol[100],n,m,i;
int afis()
{
int i;
for (i=1; i<=m; i++)
g<<a[sol[i]];
g<<endl;
}
int back(int k)
{
int i;
if (k>m) afis ();
else for (i=sol[k-1]+1; i<=n; i++)
{
sol [k]=i;
back (k+1);
}
}
int main()
{
f>>n;
f>>m;
for (i=1;i<=n;i++)
a[i]=i;
back(1);
}