Pagini recente » Cod sursa (job #2103966) | Cod sursa (job #846168) | Cod sursa (job #2479671) | Cod sursa (job #1434075) | Cod sursa (job #76181)
Cod sursa(job #76181)
#include<stdio.h>
#include<stdlib.h>
#define N 1000
int n,v[N];
void read()
{
int i;
scanf("%d",&n);
for(i=0;i<n;i++)
scanf("%d",&v[i]);
}
int maxim(const void *a,const void *b)
{
return *(int*)a-*(int*)b;
}
void solve()
{
int i,j,k,nr=0;
qsort(v,n,sizeof(v[0]),maxim);
for(i=0;i<n-2;i++)
for(j=i+1;j<n-1;j++)
for(k=j+1;k<n;k++)
if(v[i]+v[j]>=v[k]&&v[i]+v[k]>=v[j]&&v[j]+v[k]>=v[i])
nr++;
printf("%d\n",nr);
}
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
read();
solve();
return 0;
}