Cod sursa(job #1332140)
Utilizator | Data | 1 februarie 2015 18:53:02 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,m;
int c[40];
void afisare()
{
for(int i=1;i<=m;i++)
{
out << c[i] << " ";
}
out << "\n";
}
void gen(int k)
{
if(k-1==m)
afisare();
else{
c[k]=c[k-1]+1;
for (;c[k]<=n;c[k]++)
gen(k+1);
}
}
int main()
{
in >> n >> m;
gen(1);
return 0;
}