Cod sursa(job #2635249)
| Utilizator | Data | 13 iulie 2020 19:54:57 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,v[19];
void afis (int ar[19])
{
for (int i=1; i<=m; i++)
g<<ar[i]<<' ';
g<<'\n';
}
void exec (int cur,int prev,int af[19])
{
if (cur!=m)
{
for (int i=prev; i<=n-(m-cur); i++)
{
af[cur]=i;
exec(cur+1,i+1,af);
af[cur]=0;
}
}
else
{
for (int i=prev; i<=n-(m-cur); i++)
{
af[cur]=i;
afis(af);
}
af[cur]=0;
}
}
int main()
{
f>>n>>m;
exec(1,1,v);
return 0;
}
