Cod sursa(job #565734)
| Utilizator | Data | 28 martie 2011 11:14:08 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
#define dim 40400
int sol[dim];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, m;
void tiparire()
{
for(int i=1;i<=m;++i)
fout<<sol[i]<<" ";
fout<<'\n';
}
void permutari(int k, int start)
{
if(k==m+1)
tiparire();
else
for(int val=start+1;val<=n;++val)
{
sol[k]=val;
permutari(k+1,val);
}
}
int main()
{
fin>>n >>m;
permutari(1,0);
return 0;
}
