Cod sursa(job #644649)
| Utilizator | Data | 7 decembrie 2011 11:19:29 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<stdio.h>
#include<algorithm>
using namespace std;
int v[801];
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&v[i]);
sort(v+1,v+n+1);
int k=3,posib=0;
for(int i=1;i<=n;i++)
{
while(v[i]+v[i+1]<=v[k]&&k<=n)
k++;
posib+=k-i;
}
printf("%d\n",posib);
return 0;
}
