Pagini recente » Cod sursa (job #2664011) | Cod sursa (job #2680450) | Cod sursa (job #3214320) | Cod sursa (job #1923138) | Cod sursa (job #2242019)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[803], n;
int cautbin(int p, int u, int x)
{
int mij, sol;
while(p<=u) {
mij=(p+u)/2;
if(v[mij]>x)
u=mij-1;
else
p=mij+1;
}
return u;
}
int main()
{
fin>>n;
for(int i=1; i<=n; ++i)
fin>>v[i];
sort(v+1,v+n+1);
int x,sum=0;
for(int i=1; i<n-1; ++i)
for(int j=i+1; j<n; ++j) {
x=cautbin(j+1,n,v[i]+v[j]);
if(x>j)
sum+=(x-j);
}
fout<<sum<<'\n';
return 0;
}