Pagini recente » Rating Tivadar Timea (tivadar_timea) | Cod sursa (job #1151326) | Cod sursa (job #2761277) | Cod sursa (job #1805508) | Cod sursa (job #2658693)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,i,j,k,sum,a[801];
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++)
{k=i+2;
for(j=i+1; j<=n-1; j++)
{
while(a[i]+a[j]>=a[k] && k<=n)
k++;
if (k>j)
sum+=k-j-1;
}
}
fout<<sum<<'\n';
return 0;
}