Pagini recente » Cod sursa (job #1721817) | Cod sursa (job #2571008) | Cod sursa (job #2174725) | Cod sursa (job #2425141) | Cod sursa (job #872732)
Cod sursa(job #872732)
#include <fstream>
#include <algorithm>
using namespace std;
int a[1000];
int main()
{
int n,i,k=0,j,p;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
fin >> n;
for(i=1; i<=n; i++) fin >> a[i];
sort(a+1, a+n+1);
for(i=1; i<=n; i++)
for(j=i+1; j<=n; j++)
for(p=j+1; p<=n; p++)
if((a[i]+a[j]>=a[p]) && (a[p]+a[i]>=a[j]) && (a[j]+a[p] >=a[i])) k++;
else break;
fout << k;
}