Cod sursa(job #2132359)
| Utilizator | Data | 15 februarie 2018 18:36:27 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[25];
ifstream f("combinari.in");
ofstream g("combinari.out");
void back(int k,int m,int l)
{
if(k-1 == l)
{
for(int i = 1;i <= l;i++)
{
g<<a[i]<<" ";
}
g<<endl;
}
else
{
for(int i = a[k-1] + 1;i <= m;i++)
{
a[k] = i;
back(k+1,m,l);
}
}
}
int main()
{
int m,n;
f>>m>>n;
back(1,m,n);
return 0;
}
