Cod sursa(job #1637377)
Utilizator | Data | 7 martie 2016 16:57:19 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#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);
}