Pagini recente » Cod sursa (job #1275648) | Cod sursa (job #2704899) | Cod sursa (job #3319996) | Cod sursa (job #948107) | Cod sursa (job #1262463)
# include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,m;
int v[19];
int verific(int k)
{
int i;
for (i=1;i<=k-1;i++) if (v[i]>=v[k]) return 0;
return 1;
}
void back(int k)
{
int i;
if (k==m+1)
{
for (i=1;i<=m;i++) out<<v[i]<<' ';
out<<'\n';
}
else
for (i=1;i<=n;i++)
{
v[k]=i;
if (verific(k)) back(k+1);
}
}
int main()
{
in>>n>>m;
back(1);
return 0;
}