Cod sursa(job #3178359)
| Utilizator | Data | 1 decembrie 2023 17:06:32 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[100001];
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int main()
{
int n;
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>v[i];
}
sort(v+1,v+n+1);
int k=0;
for(int i=1;i<=n;i++)
{
for(int j=i+1;j<=n;j++)
{
int a=v[i];
int b=v[j];
int st=j+1;
int dr=n;
while(st<=dr)
{
int mij=(st+dr)/2;
if(v[mij]<=a+b)
{
k++;
st=mij+1;
}
else
{
dr=mij-1;
}
}
}
}
cout<<k;
return 0;
}
