acm-小弟不才，求完整代碼

小弟不才，求完整代碼

如圖，交了十多次還不ac，求解！ac了就好 用c語言提交 在線等 求大神幫解

最佳回答：

// 20151108csdnacm.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include "stdio.h"
#define MAX_N 100
#define MAX_COMB 100*99/2

int pair_add(int a[],int n,int b[]);
int repeat_del(int a[],int n);
int final_sum(int a[],int n);

int main(int argc, char* argv[])
{
int n = 1,pair_num,final_num,sum;
int i;
printf("Please input the number scale n (2=<n<=100):");
scanf("%d",&n);
while ( n != 0) {
int a[MAX_N];
int add[MAX_COMB];
for(i = 0;i < n;i++) { //Input the numbers (and we can add error handling if it's needed）.
scanf("%d",&a[i]); //cannot written as a[i] here.
}
pair_num = pair_add(a,n,add);
final_num = repeat_del(add,pair_num);
sum = final_sum(add,final_num);
printf("SUM is %d\n",sum);

    printf("\nPlease input the number scale n (2=<n<=100 and 0 to quit):");
    scanf("%d",&n);
}   
return 0;

}

int pair_add(int a[],int n,int b[]) {
int i,j,k = 0;
for (i = 0;i < n-1;i++) {
for (j = i+1;j < n;j++) {
b[k] = a[i] + a[j];
k++;
}
}
return k;
}

int repeat_del(int a[],int n) {
int i,j,k;
for (i = 0;i < n-1;i++) {
for (j = i+1;j < n;j++) {
if (a[i] == a[j]) {
for (k = j;k < n-1;k++)
a[k] = a[k+1];
n--;
j--;
}
}
}
return n;
}

int final_sum(int a[],int n) {
int sum = 0,i;
for(i = 0;i < n;i++)
sum += a[i];
return sum;
}