@[Lip041](/space/show?uid=198738) 希望更丰富的展现？使用Markdown
by foxdemon @ 2019-05-17 10:02:03
## 蒟蒻的回复
```cpp
#include<iostream>
#include<cstring>
#include<algorithm>
#include<stdio.h>
using namespace std;
int a[108]={0},b[108]={0};
int main()
{
int i,j,n;
scanf("%d",&n);
int x=n-1;
for(int i=0;i<n;i++){
cin>>a[i];
}
int sum=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
for(int k=0;k<n;k++){
if(a[k]+a[j]==a[i]&&k!=j&&b[i]==0){
sum++;
b[i]=1;
}
}
}
}
cout<<sum;
return 0;
}
by charliegong @ 2019-05-17 10:38:52
@[charliegong](/space/show?uid=95626) 把第三层循环k=0改为k=j+1，再把if里的k！=j删掉就AC了
by Strong_Jelly @ 2019-05-17 11:00:27
```cpp
#include<iostream>
#include<cstring>
#include<algorithm>
#include<stdio.h>
using namespace std;
int a[108]={0},b[108]={0};
int main()
{
int i,j,n;
scanf("%d",&n);
int x=n-1;
for(int i=0;i<n;i++){
cin>>a[i];
}
int sum=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
for(int k=j+1;k<n;k++){
if(a[k]+a[j]==a[i]&&b[i]==0){
sum++;
b[i]=1;
}
}
}
}
cout<<sum;
return 0;
}
```
by Strong_Jelly @ 2019-05-17 11:00:57
看错了
by Strong_Jelly @ 2019-05-17 11:04:09
@[foxdemon](/space/show?uid=110278)
include<stdio.h>
int main()
{
int n,flag=0,i,j,k,count=0;
int a[100];
scanf("%d",&n);
for(i=0;i<n;i++)scanf("%d",&a[i]);
for(i=0;i<n;i++)
{
for(j=0;j<n&&j!=i;j++)
{
for(k=0;k<n&&k!=j&&k!=i;k++)
if(a[i]==(a[k]+a[j])&&a[k]!=a[j]) flag=1;
}
if(flag==1)count++;
}
printf("%d",count);
return 0;
}
by Lip0041 @ 2019-05-17 19:56:46