Cod sursa(job #1347904)
Utilizator | Data | 19 februarie 2015 12:46:14 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m, x[20];
void afisare()
{
int i;
for(i=1;i<=m;i++)
fout << x[i]<< ' ';
fout << '\n';
}
void combinari(int k)
{
int i;
if(k>m)
afisare();
else
for(i=x[k-1]+1;i<=n-m+k;i++)
{
x[k]=i;
combinari(k+1);
}
}
int main()
{
fin >> n >> m;
combinari(1);
return 0;
}