Cod sursa(job #3256561)
Utilizator | Data | 15 noiembrie 2024 10:26:03 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int n,u,a[100001];
int main()
{
cin>>n;
for(int i=1; i<=n; ++i)
{
cin>>a[i];
}
sort(a+1,a+n+1);
for(int i=n; i>1; --i)
for(int j=i-1; j>=1; --j)
{
if(a[lower_bound(a+1,a+n+1,a[i]+a[j])-a]>a[i]+a[j])
u++;
}
cout<<u;
}