```cpp
#include<bits/stdc++.h>
using namespace std;
int n,a[105],tmp,sum=0;
bool c[105];
int main(){
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&a[i]);
c[i]=false;
}
sort(a,a+n);
for(int i=0;i<n;i++){
for(int j=i+1;j<n;j++){
tmp=a[i]+a[j];
for(int k=j+1;k<n;k++){
if(c[k]==true){
continue;
}
if(a[k]==tmp){
sum++;
c[k]=true;
}
}
}
}
printf("%d",sum);
return 0;
}
```
关注一下呗
@[ljx15653581765](/user/920794)
by BEST_CAT @ 2023-02-06 20:49:00
后排代码(部分)
```cpp
#include<_________>
#include<__________>
using namespace std;
int n;
int a[200],ans=0;
bool find(int k){
for(int i=1;i<=k;i++)
for(int j=i+1;j<=k;j++)
if(a[i]+a[j]==a[k]) return true;
return false;
}
int main(){
cin>>n;
for(int i=1;i<=n;i++) cin>>a[i];
sort(a+1,a+n+1);
____________________
_________
cout<<ans;
return 0;
}
```
by zhuruirong @ 2023-02-06 20:52:33
为什么要排序?
by ljx15653581765 @ 2023-02-06 22:13:18