Ultraviolet A 11063-B2-Sequence

Question: In {b1, b2,..., BK}, let's determine if the sum of any two numbers is different.

Analysis: number theory. Calculate all the results and sort them to determine whether the adjacent results are the same.

Note: Question 500 (⊙ _ ⊙ ).

#include <iostream>#include <cstdlib>#include <cstdio>using namespace std;int data[111];int sum[5555];int main(){int n,T = 1;while (~scanf("%d",&n)) {for (int i = 0 ; i < n ; ++ i)scanf("%d",&data[i]);int count = 0;for (int i = 0 ; i < n ; ++ i)for (int j = 0 ; j < i ; ++ j)sum[count ++] = data[i]+data[j];sort(sum, sum+count);int flag = 0;for (int i = 1 ; i < count ; ++ i)if (sum[i] == sum[i-1]) {flag = 1;break;}if (!flag)printf("Case #%d: It is a B2-Sequence.\n\n",T ++);else printf("Case #%d: It is not a B2-Sequence.\n\n",T ++);}return 0;}

Ultraviolet A 11063-B2-Sequence