Pagini recente » Cod sursa (job #3148577) | Istoria paginii runda/lll | Cod sursa (job #2749406) | Cod sursa (job #2710810) | Cod sursa (job #2527527)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,i,j,k,sum,a[10001];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
{
fin>>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=n; k>j; k--)
{
if(a[i]+a[j]>=a[k]&&a[i]+a[k]>=a[j])
{
sum+=(k-j);
break;
}
}
}
}
fout<<sum<<'\n';
return 0;
}