Pagini recente » Cod sursa (job #2108506) | Cod sursa (job #2255774) | Cod sursa (job #2677893) | Cod sursa (job #2296491) | Cod sursa (job #1363106)
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
const int l=16;
int v[801],n,a;
int cautbin(int x)
{
int i=0,pas=1<<l;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
return i;
}
int main()
{
f>>n; int i,j,k; int nr=0;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(i=1; i<=n-2; i++)
for(j=i+1; j<=n-1; j++)
{
a=cautbin(v[i]+v[j]);
if(a>j)
nr+=a-j;
}
g<<nr<<'\n';
f.close();
g.close();
return 0;
}