Cod sursa(job #237621)
| Utilizator | Data | 30 decembrie 2008 11:19:20 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[805];
int n,nrt;
int main ()
{
freopen ("nrtri.in","r",stdin);
freopen ("nrtri.out","w",stdout);
int i,j,k;
scanf ("%d",&n);
for (i=1; i<=n; ++i)
scanf ("%d",&a[i]);
sort (a+1,a+n+1);
for (i=1; i<=n-2; ++i)
for (j=i+1; j<=n-1; ++j)
for (k=j+1; k<=n; ++k)
if (a[i]+a[j]>=a[k])
++nrt;
printf ("%d",nrt);
return 0;
}
