Cod sursa(job #3337806)
| Utilizator | Data | 30 ianuarie 2026 09:28:54 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[801];
int main()
{
int n,s,st,dr,mij,ras;
long long int total=0;
fin>>n;
for(int i=1;i<=n;i++) {
fin>>v[i];
}
sort(v+1,v+n+1);
for(int i=1;i<=n;i++) {
for(int j=i+1;j<=n;j++) {
s=v[i]+v[j];
st=j+1;
dr=n;
ras=j;
while(st<=dr) {
mij=(st+dr)/2;
if(v[mij]<=s) {
ras=mij;
st=mij+1;
}
else dr=mij-1;
}
total+=ras-j;
}
}
fout<<total;
return 0;
}
