Pagini recente » Cod sursa (job #1680760) | Cod sursa (job #400203) | Cod sursa (job #1788134) | Borderou de evaluare (job #2623998) | Cod sursa (job #2494935)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int v[801];
int main()
{
short int i,n,j,k,cnt=0;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
{
for(j=i+1;j<=n-1;j++)
{
k=j+1;
while(v[i]+v[j]>=v[k]&&k<=n)
{
cnt++;
k++;
}
}
}
cout<<cnt;
return 0;
}