Pagini recente » Borderou de evaluare (job #2164372) | Borderou de evaluare (job #837248) | Borderou de evaluare (job #1108968) | Cod sursa (job #1970260) | Cod sursa (job #1011122)
#include <iostream>
#include <cstdio>
using namespace std;
FILE *f,*g;
int S[7],A[101];
void scriesol(int n)
{
int i;
for(i=1;i<=n;i++)
{
fprintf(g,"%d ",S[i]);
}
fprintf(g,"\n");
}
void back(int k, int n, int SS, int sumact)
{
int i,j;
if(k==n&&sumact==SS) scriesol(n);
else
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
int p=sumact+A[j];
if(p<=SS)
{
S[k+1]=A[j];
sumact=sumact+A[j];
back(k+1,n,SS,sumact);
}
}
}
}
}
int main()
{
f=fopen("loto.in","r");
g=fopen("loto.out","w");
int N,SS;
fscanf(f,"%d%d",&N,&SS);
for(int i=1;i<=N;i++)
{
fscanf(f,"%d",&A[i]);
}
back(0,N,SS,0);
return 0;
}