1117: Problem C – Sumsets

题目描述

Problem C – Sumsets
Given S, a set of integers, find the largest d such that a + b + c = d where a, b, c, and d are distinct elements of S.

输入

Several S, each consisting of a line containing an integer 1 <= n <= 1000 indicating the number of elements in S, followed by the elements of S, one per line. Each element of S is a distinct integer between -536870912 and +536870911 inclusive. The last line of input contains 0.

输出

For each S, a single line containing d, or a single line containing "no solution".

样例输入

5
2 
3 
5 
7 
12
5
2 
16 
64 
256 
1024
0

样例输出

12
no solution

参考代码

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
int c,i,j,k,n,wn;
char w[10001][100], buf[1000];
int main() 
{
    while (1 == scanf("%d",&n)) 
    {
        if (c++) printf("n");
      wn = 0;
      for (;;) {
         if (1 != scanf("%[^a-zA-Z]",buf)) break;
         if (1 != scanf("%[a-zA-Z]",buf)) break;
         if (!strcmp(buf,"EndOfText")) break;
         for (i=0;buf[i];i++) buf[i] = tolower(buf[i]);
         strcpy(w[wn++],buf);
      }
      qsort(w,wn,100,strcmp);
      strcpy(w[wn++],"***");
      strcpy(buf,"$$$");
      for (i=j=0;i<wn;i++) {
         if (strcmp(buf,w[i])) {
            if (strcmp(buf,"$$$") && k == n) printf("%sn",buf),j=1;
            strcpy(buf,w[i]);
            k = 0;
         }
         k++;
      }
      if (!j) printf("There is no such word.n");
   }
}

解析

暂无