洛谷 P2141 [NOIP2014 普及组] 珠心算测验 C/C++

//#define LOCAL
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define inf 0x3f3f3f3f
#define eps 1e-6
using namespace std;
#define clr(x) memset(x,0,sizeof((x)))
const int maxn = 1e5+1;
#define MAX(a,b) (a)>(b)?(a):(b)
int main() {
#ifdef LOCAL 
	freopen("data.in","r",stdin);
	freopen("data.out","w",stdout);
#endif
	int n;
	cin>>n;
	int arr[105],buf[maxn];
	clr(buf);
	for(int i = 0;i<n;i++)
		cin>>arr[i];
	for(int i = 0;i<n;i++) {
		buf[arr[i]] = 1;
	}
	int cnt = 0,x;
	for(int i = 0;i<n;i++) {
		for(int j = i+1;j<n;j++) {
			x = buf[arr[i]+arr[j]];
			if(x) {
				if(x==1)cnt++;
				buf[arr[i]+arr[j]]++;
			}
		}
	}
	cout<<cnt;
	return 0;
}