Cod sursa(job #2137907)
Utilizator | Data | 21 februarie 2018 09:23:17 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
long long s,v[801],i,j,n,c,nr=0;
int main()
{
f>>n;
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++)
{s=v[i]+v[j];
c=upper_bound(v+1,v+n+1,s)-v;
nr=nr+c-j-1;
}}
g<<nr;
return 0;
}