Cod sursa(job #3374161)
| Utilizator | Data | 8 noiembrie 2026 19:35:02 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.72 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bete2.in");
ofstream fout("bete2.out");
int n,v[3001];
int cb(int x, int st, int dr)
{
int mij, ans=n;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>x)
{
ans=mij;
dr=mij-1;
}
else if(v[mij]<=x)
st=mij+1;
}
return ans;
}
int main()
{
fin>>n;
for(int i=0; i<n; i++)
fin>>v[i];
sort(v, v+n);
int cnt=0;
for(int i=0; i<n; i++)
{
for(int j=i+1; j<n; j++)
{
int s=v[i]+v[j];
int p=cb(s, j+1, n-1);
cnt+=p-(j+1);
}
}
fout<<cnt;
return 0;
}
