Cod sursa(job #1131582)
Utilizator | Craciun Valentin-Gabriel valentin11c | Data | 28 februarie 2014 21:49:08 |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,kk,a[100],fol[100],kkk=1,sum[1000],s;
void afisare()
{
for(int i=1;i<=kk;i++) g<<a[i]<<" ";
g<<"\n";
}
void back(int k)
{
int i;
if(k>kk) {if(sum[s]==0) {afisare();sum[s]=1;}}
else
{
for(i=1;i<=n;i++)
{
if(fol[i]==0) {a[k]=i;s+=a[k];fol[i]=1;back(k+1);fol[i]=0;s-=i;}
}
}
}
int main()
{
f>>n>>kk;
back(1);
return 0;
}