Pagini recente » Cod sursa (job #246115) | Cod sursa (job #293284) | Cod sursa (job #2361602) | Cod sursa (job #2102397) | Cod sursa (job #31578)
Cod sursa(job #31578)
#include<stdio.h>
main()
{
FILE *f,*g;
f=fopen("loto.in","r");
g=fopen("loto.out","w");
int N,S,V[110];
int i,valid=0;
fscanf(f,"%d %d",&N,&S);
for(i=1;i<=N;i++)
fscanf(f,"%d",&V[i]);
int j,k,l,m,n;
long x;
for(i=1;((i<=N)&&(valid==0));i++)
{ x=V[i]+5;
if(x<=S)
{
for(j=1;((j<=N)&&(valid==0));j++)
{ x=V[i]+V[j]+4;
if(x<=S)
{
for(k=1;((k<=N)&&(valid==0));k++)
{ x=V[i]+V[j]+V[k]+3;
if(x<=S)
{
for(l=1;((l<=N)&&(valid==0));l++)
{ x=V[i]+V[j]+V[k]+V[l]+2;
if(x<=S)
{
for(m=1;((m<=N)&&(valid==0));m++)
{ x=V[i]+V[j]+V[k]+V[l]+V[m]+1;
if(x<=S)
{
for(n=1;((n<=N)&&(valid==0));n++)
{
x=V[i]+V[j]+V[k]+V[l]+V[m]+V[n];
if (x==S)
{fprintf(g,"%d %d %d %d %d %d\n",V[i],V[j],V[k],V[l],V[m],V[n]);valid=1;}
if (x>S)n=N+1;
}
}
}
}
}
}
}
}
}
}
}
if(valid==0)fprintf(g,"-1\n");
fclose(f);
fclose(g);
return 0;
}