Cod sursa(job #1553115)
Utilizator | Data | 19 decembrie 2015 12:06:26 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int sol[1001],n,m;
void afisare()
{int i;
for(i=1;i<=m;i++)g<<sol[i]<<" ";
g<<'\n';
}
void combinari(int k)
{int i;
if(k>m)afisare();
else {
for(i=sol[k-1]+1;i<=n;i++)
{sol[k]=i;
combinari(k+1);
}
}
}
int main()
{
f>>n>>m;
combinari(1);
return 0;
}