Cod sursa(job #3331783)
| Utilizator | Data | 30 decembrie 2025 22:51:38 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n;
int v[805];
int main()
{
fin>>n;
for(int i=1; i<=n; i++)
fin>>v[i];
sort(v+1,v+n+1);
int contor=0;
for(int i=1; i<=n-2; i++)
{
for(int j=i+1; j<=n-1; j++)
{
int st=j+1,dr=n;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]<=v[i]+v[j])
{
contor++;
st=mij+1;
}
else
dr=mij-1;
}
}
}
fout<<contor;
}
