Cod sursa(job #2152553)
| Utilizator | Data | 5 martie 2018 17:29:10 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
int v[1005];
int main()
{
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int n,cnt=0;
cin>>n;
for(int i=1; i<=n; i++)
cin>>v[i];
sort(v+1,v+n+1);
for(int i=1; i<n-1; i++)
for(int j=i+1; j<n; j++)
{
int st=j+1,dr=n,mijl=(st+dr)/2;
while(st<=dr)
{
if(v[i]+v[j]<v[mijl])
{
dr=mijl-1;
}
else
st=mijl+1;
mijl=(st+dr)/2;
}
cnt+=mijl-j;
}
cout<<cnt;
return 0;
}
