Cod sursa(job #596552)
| Utilizator | Data | 17 iunie 2011 18:55:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
using namespace std;
short n,k,v[20],uz[20];
ofstream fout("combinari.out");
void Back(short pas)
{
short i,limita;
if(pas==k+1)
{
for(i=1;i<=k;i++)
fout<<v[i]<<' ';
fout<<"\n";
}
else
{
limita=n-k+pas;
for(i=v[pas-1]+1;i<=limita;i++)
{
if(uz[i]==0)
{
v[pas]=i;
uz[i]=1;
Back(pas+1);
uz[i]=0;
}
}
}
}
int main()
{
ifstream fin("combinari.in");
fin>>n>>k;
fin.close();
Back(1);
fout.close();
return 0;
}
