```cpp
#include<iostream>
using namespace std;
#define maxn 101
int main()
{
int n,count = 0;
cin >> n;
int a[maxn] = {0};
//数据的输入
for (int i = 0; i < n; i++)
{
cin >> a[i];
}
//遍历来比较
for (int i = 0; i < n; i++)
{
//显然内部还需要遍历，因为我们要对给定的元素比较集合中剩下的所有元素
for (int pos1 = (i + 1) % n; pos1 != i ; pos1 = (pos1+1) % n)
{
for (int pos2 = (pos1 + 1) % n; pos2 != i; pos2 = (pos2 + 1) % n)
{
if (a[i] == (a[pos1] + a[pos2]))
{
count++;
}
}
}
}
cout << count << endl;
system("pause");
return 0;
}
```
更改之后的代码如下，还是30分
by judgementbutcher @ 2023-03-27 23:40:47
@[judgementbutcher](/user/864703) 你要记录下重复的
```cpp
#include<iostream>
using namespace std;
int main(){
int n,a[100],b[100],l=0;
cin>>n;
for(int i=0;i<n;i++){
cin>>a[i];
b[i]=2;
}
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
for(int k=0;k<n;k++){
if(a[k]==a[i]+a[j]&&b[k]!=1){
l++;
b[k]=1;
}
}
}
}
cout<<l;
return 0;
}
```
by manyc @ 2023-03-31 21:20:58
@[manyc](/user/826520) 是的，谢谢
by judgementbutcher @ 2023-04-01 11:29:58