Cod sursa(job #368946)
Utilizator | Data | 26 noiembrie 2009 18:25:02 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
//Sa se genereze toate combinarile de N luate cate K in ordine lexicografica
#include<iostream>
#include<fstream>
using namespace std;
int n,k,x[20];
ofstream fout("combinari.out");
void afis()
{
for(int i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<endl;
}
void back(int j)
{
int i;
for(i=x[j-1]+1;i<=n;i++)
{
x[j]=i;
if(j==k)
{
afis();
}
else
back(j+1);
}
}
int main()
{
ifstream fin("combinari.in");
fin>>n>>k;
fin.close();
back(1);
return 0;
}