Pagini recente » Cod sursa (job #2758625) | Cod sursa (job #2734779) | Cod sursa (job #875433) | Cod sursa (job #1916642) | Cod sursa (job #2402967)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,j,k,nr;
int v[801];
int triunghi(int a, int b, int c)
{
if (a+b>=c && a+c>=b && b+c>=a)
return 1;
return 0;
}
int main()
{
f>>n;
for (i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for (i=1;i<=n-2;i++)
for (j=i+1;j<=n-1;j++)
for (k=j+1;k<=n && triunghi(v[i],v[j],v[k]);k++)
nr++;
g<<nr;
return 0;
}