Pagini recente » Cod sursa (job #1926843) | Cod sursa (job #2472887) | Cod sursa (job #1254028) | Cod sursa (job #1753456) | Cod sursa (job #1631192)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,a[805],i,j,k,nr;
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;j<=n-1;j++)
{
for(k=j;k<=n;k++)
{
if(k!=i && i!=j && k!=j)
{
if(a[i]+a[j]>=a[k] && a[j]+a[k]>=a[i] && a[k]+a[i]>=a[j])
{
nr++;
}
else
break;
}
}
}
}
fout<<nr;
return 0;
}