Pagini recente » Borderou de evaluare (job #870893) | Cod sursa (job #3294992) | Borderou de evaluare (job #3120486) | Borderou de evaluare (job #1216200) | Cod sursa (job #777987)
Cod sursa(job #777987)
# include<stdio.h>
int n,v[801],i,a,b,c,j,h,contor;
int main()
{
contor=0;
scanf("%d", &n);
for(i=0;i<n;i++)
{
scanf("%d", &v[i]);
}
for(i=0;i<n-2;i++)
for(j=i+1;j<n-1;j++)
for(h=j+1;h<n;h++)
if ( ( v[i]+v[j]>=v[h] )&& (v[i]+v[h]>=v[j] )&&( v[j]+v[h]>=v[i] ) )
{
contor++;
}
printf("%d", contor);
return 0;
}