Cod sursa(job #3350429)
| Utilizator | Data | 7 aprilie 2026 19:44:14 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int main()
{
int n,v[805];
long long ans;
cin>>n;
for(int i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
for(int k=3;k<=n;k++)
{
int i=1,j=k-1;
while(i<j)
{
if(v[i]+v[j]>=v[k])
{
ans+=(j-i);
j--;
}
else
i++;
}
}
cout<<ans;
return 0;
}
