Cod sursa(job #448435)
| Utilizator | Data | 3 mai 2010 19:28:22 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
#define nmax 50
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int x[nmax],n,k;
void afisare()
{for(int i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<'\n';
}
void back(int pas)
{if(pas>k) afisare();
else for(x[pas]=x[pas-1]+1;x[pas]<=n-k+pas;x[pas]++)
back(pas+1);
}
int main()
{fin>>n>>k;
back(1);
fin.close();
fout.close();
return 0;
}
