Cod sursa(job #2387362)
Utilizator | Data | 24 martie 2019 15:54:03 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f ( "nrtri.in" ); ofstream g ( "nrtri.out" );
int main()
{ int sol=0,n,v[100006]={0};
f>>n;
for(int i=1;i<=n;i++) f>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<n;i++)
for(int j=i+1;j<=n;j++)
{ int l=v[i]+v[j],p;
p=upper_bound(v+j+1,v+n+1,l)-v-1;
if(p>=1 and p<=n) sol+=(p-j);
}
g<<sol;
return 0;
}