Cod sursa(job #544966)
Utilizator | Data | 2 martie 2011 15:25:34 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
int n,m,sol[100];
ifstream f("combinari.in");
ofstream g("combinari.out");
void afisare()
{
for(int j=1;j<=m;j++)
g<<sol[j]<<" ";
g<<"\n";
}
void gen(int k)
{
for(int i=sol[k-1]+1;i<=n-m+k;i++)
{
sol[k]=i;
if(k==m)
afisare();
else
gen(k+1);
}
}
int main()
{
f>>n>>m;
gen(1);
return 0;
}