Cod sursa(job #2204150)
| Utilizator | Data | 14 mai 2018 19:30:19 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <cstdio>
#include <algorithm>
using namespace std;
int v[800];
//a+b>=c
int main()
{
int n,i,t=0,j,st,dr,s,m,nr;
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&v[i]);
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{
s=v[i]+v[j];
st=j;
dr=n;
while(st<dr)
{
m=(st+dr)/2;
if(v[m]>s)dr=m-1;
else
{
nr=m-j+1;
st=m+1;
}
}
t=t+nr;
}
printf("%d",t);
return 0;
}
