Pagini recente » Borderou de evaluare (job #1762011) | Cod sursa (job #3278191) | Cod sursa (job #2165128) | Cod sursa (job #1541096) | Cod sursa (job #921051)
Cod sursa(job #921051)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int a[801];
int main()
{ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int i,j,k,n,nr=0;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
sort(a+1,a+n+1);
for(i=1;i<n-1;i++)
for(j=i+1;j<n;j++)
{for(k=n;k>=j+1;k--)
if(a[i]+a[j]>=a[k]&&a[i]+a[k]>=a[j]&&a[k]+a[j]>=a[i])
break;
if(k>j)
nr+=k-j;
}
fout<<nr;
return 0;
}