Cod sursa(job #299729)
| Utilizator | Data | 6 aprilie 2009 22:36:25 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 60 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
int v[801],i,j,n,nr,k,ok=0;
int main()
{
freopen("nrtri.in","r",stdin);
scanf("%d", &n);
for (i=0;i<n;++i)
scanf("%d", &v[i]);
sort(v,v+n);
for (i=0;i<n-2;++i)
for (j=i+1;j<n-1;++j)
for (k=j+1;k<=n;++k)
if (v[k]<=v[i]+v[j] && v[j]<=v[k]+v[i] && v[i]<=v[k]+v[j]) nr++;
else break;
freopen("nrtri.out","w",stdout);
printf("%d",nr);
return 0;
}
