Cod sursa(job #2604511)
Utilizator | Data | 22 aprilie 2020 19:40:44 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <bits/stdc++.h>
using namespace std;
//#define oo 2000000010;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
const int N=810;
int n,v[N],nr;
int main()
{
f>>n;
for(int i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(int i=1;i<n-1;i++)
for(int j=i+1;j<n;j++)
{
int poz=j;
while(poz<n&&v[i]+v[j]>=v[poz+1])
poz++;
nr+=poz-j;
}
g<<nr;
return 0;
}