Pagini recente » Cod sursa (job #3141730) | Cod sursa (job #843423) | Cod sursa (job #2934386) | Cod sursa (job #2232653) | Cod sursa (job #405335)
Cod sursa(job #405335)
#include<stdio.h>
#include<stdlib.h>
#define MAXN 101
FILE *f=fopen("loto.in","r"),*g=fopen("loto.out","w");
int N,S,V[MAXN];
int compare (const void * a, const void * b)
{
return ( *(int*)a - *(int*)b );
}
int main()
{
int i,j,k,l,m,n,valid=0;
fscanf(f,"%d %d",&N,&S);
for(i=0;i<N;i++)
fscanf(f,"%d",&V[i]);
qsort(V,N,sizeof(int),compare);
for(i=0;i<N;i++)
for(j=0;j<N;j++)
for(k=0;k<N;k++)
for(l=0;l<N;l++)
for(m=0;m<N;m++)
for(n=0;n<N;n++)
{ if (V[i]+V[j]+V[k]+V[l]+V[m]+V[n]==S)
{fprintf(g,"%d %d %d %d %d %d\n",V[i],V[j],V[k],V[l],V[m],V[n]);
valid=1;
}
else if (V[i]+V[j]+V[k]+V[l]+V[m]+V[n]==S) n=N;
}
if(valid==0)fprintf(f,"-1\n");
}