Cod sursa(job #609362)
| Utilizator | Data | 20 august 2011 21:47:55 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<stdio.h>
#include<cstdio>
#include<algorithm>
using namespace std;
int v[813],n,i,nr=0,k;
int main()
{
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-2;++i)
for(int j=i+1;j<=n-1;++j)
{
for(k=j+1;k<=n && v[i]+v[j]>=v[k];++k);
nr+=k-j-1;
}
printf("%d", nr);
return 0;
}