Cod sursa(job #2436875)
| Utilizator | Data | 7 iulie 2019 14:39:32 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int main()
{
int n,v[2001],i,s=0,x,y,z;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
sort(v+1,v+n+1);
for(y=n;y>2;y--)
{
for(x=y-1;x>1;x--)
{
z=v[y]-v[x];
int pos=0,msk;
for(msk=1<<30;msk>0;msk/=2)
if(pos+msk<=n && v[pos+msk]<=z)
pos+=msk;
s=s+(x-pos);
}
}
out<<s;
return 0;
}
