You have to find the closest sum by reading the data from file i tried but i cant get it to run
mu code is :
CODE
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
#define N 23
int main()
{
fopen("data.dat","r";
int cas=1,n,i,j,h,m,z,a[N],l,dif,now,pre,b[N];
scanf("%ld",&n);
while n!=0);
{
printf("Case %d:\n",cas);cas++;
for(i=0;i<n;i++) scanf("%ld",&b[i]);
for(i=0;i<n;i++)
{
h=i;
for(j=i+1;j<n;j++) if(b[j]<b[h]) h=j;
j=b[h];b[h]=b[i];b[i]=j;
}
h=1;a[0]=b[0];
for(i=1;i<n;i++) if(b[i]!=b[i-1]) a[h++]=b[i];n=h;
scanf("%ld",&m);
for(z=0;z<m;z++)
{
scanf("%ld",&l);
dif=pre=abs(a[0]+a[1]-l),now=a[0]+a[1];
for(i=0;i<n;i++)
{
for(j=i+1;j<n && abs(a[i]+a[j]-l)<=pre;j++)
pre=abs(a[i]+a[j]-l);
if(pre<dif) dif=pre,now=a[i]+a[j-1];
}
printf("Closest sum to %ld is %ld.\n",l,now);
}
}
this is what the question asks
Input
Input contains multiple cases.
Each case starts with an integer n (1<n<=20), which indicates, how many numbers are in the set of integer. Next n lines contain n numbers. Of course there is only one number in a single line. The next line contains a positive integer m giving the number of queries, 0 < m < 5. The next m lines contain an integer of the query, one per line.
Input is terminated by a case whose n=0. Surely, this case needs no processing.
Output
Output should be organized as in the sample below. For each query output one line giving the query value and the closest sum in the format as in the sample. Inputs will be such that no ties will occur.
Sample input
5
3
12
17
33
34
3
1
51
30
3
1
2
3
3
1
2
3
3
1
2
3
3
4
5
6
0
Sample output
Case 1:
Closest sum to 1 is 15.
Closest sum to 51 is 51.
Closest sum to 30 is 29.
Case 2:
Closest sum to 1 is 3.
Closest sum to 2 is 3.
Closest sum to 3 is 3.
Case 3:
Closest sum to 4 is 4.
Closest sum to 5 is 5.
Closest sum to 6 is 5.
| 