Pagini recente » Cod sursa (job #386540) | Cod sursa (job #1962056) | Cod sursa (job #1751714) | Cod sursa (job #496684) | Cod sursa (job #2269744)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("bet2.in");
ofstream fout ("bete2.out");
int i,n,j,ap,st,dr,mij,suma,v[3002];
int main (){
fin>>n;
for(i=1;i<=n;i++)
fin>>v[i];
sort(v+1, v+n);
for(i=1;i<n-1;i++)
for(j=1;j<n;j++){
suma=v[i]+v[j];
st=j+1;
dr=n;
while(st<=dr){
mij=(st+dr)/2;
if(v[mij]>suma)
st=mij-1;
else{
if(v[mij]<suma)
dr=mij+1;
else{
ap++;
break;
}
}
}
}
fout<<ap;
return 0;
}