Cod sursa(job #1188343)
Utilizator | Data | 19 mai 2014 14:03:10 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,i,m,c[20];
void citire();
void generare(int);
void afisare();
int main()
{
citire();
generare(1);
return 0;
}
void citire()
{
f>>n>>m;
}
void afisare()
{
for(i=1;i<=m;i++)
g<<c[i]<<" ";
g<<"\n";
}
void generare(int k)
{
if(k-1==m)
afisare();
else
for(i=c[k-1]+1;i<=n-m+k;i++)
{
c[k]=i;
generare(k+1);
}
}