Cod sursa(job #390735)
| Utilizator | Data | 4 februarie 2010 14:07:42 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
int n,v[801],i,j,k,rez=0;
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++)
{
k=i+2;
for(j=i+1;j<=n;j++)
{
while(k<=n && v[k]<=v[i]+v[j])
k++;
rez+=k-j-1;
}
}
printf("%d\n",rez);
return 0;
}
