Pagini recente » Cod sursa (job #439940) | Istoria paginii runda/2022-baraj-seniori | Cod sursa (job #1201744) | Istoria paginii runda/gm_1 | Cod sursa (job #235552)
Cod sursa(job #235552)
#include <stdio.h>
int a[805];
int n,nrt;
int main ()
{
freopen ("nrtri.in","r",stdin);
freopen ("nrtri.out","w",stdout);
int i,j,k,max1,max2,max3;
scanf ("%d",&n);
for (i=1; i<=n; ++i)
scanf ("%d",&a[i]);
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]) && (a[i]+a[k]>=a[j]) && (a[k]+a[j]>=a[i]))
++nrt;
printf ("%d",nrt);
return 0;
}