Pagini recente » Cod sursa (job #2521742) | Statistici Craciun Serban (s3rbanika) | Cod sursa (job #2429973) | Cod sursa (job #2078116) | Cod sursa (job #1808340)
#include<stdio.h>
int v[101];
int main () {
FILE *fin, *fout;
int n,i,j,s,max,min,ok,a,b,c,d,e,f;
fin=fopen("loto.in","r");
fscanf(fin,"%d%d",&n,&s);
max=0;
min=100000;
ok=0;
n++;
for(i=1;i<n;i++) {
fscanf(fin,"%d",&v[i]);
if(v[i]>max)
max=v[i];
if(v[i]<min)
min=v[i];
}
fclose(fin);
//printf("%d %d",min,max);
if(min*6>s || max*6<s) {
printf("-1");
ok=1;
}
a=0;
if(ok==0) {
// while(ok==0 || a<n)
//{
//printf("trecere prin ciclu\n");
while(a<n-1 && ok==0) {
a++;
b=0;
while(b<n-1 && ok==0) {
b++;
c=0;
while(c<n-1 && ok==0) {
c++;
d=0;
while(d<n-1 && ok==0) {
d++;
e=0;
while(e<n-1 && ok==0) {
e++;
f=0;
while(f<n-1 && ok==0) {
f++;
if(v[a]+v[b]+v[c]+v[d]+v[e]+v[f]==s)
ok=1;
}
}}}}
}
}
fout=fopen("loto.out","w");
fprintf(fout,"%d %d %d %d %d %d",v[a],v[b],v[c],v[d],v[e],v[f]);
fclose(fout);
return 0;
}