Pagini recente » Cod sursa (job #1938896) | Cod sursa (job #1828667) | Cod sursa (job #591252) | Cod sursa (job #2866171) | Cod sursa (job #1413760)
#include <cstdio>
#include <algorithm>
using namespace std;
int a[805],i,n,nr,j,k;
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
scanf("%d\n",&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])
{
nr++;
}
else break;
printf("%d\n",nr);
return 0;
}