Pagini recente » Cod sursa (job #2799276) | Cod sursa (job #117916) | Cod sursa (job #2468676) | Cod sursa (job #2999738) | Cod sursa (job #872986)
Cod sursa(job #872986)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int main()
{ int N,a[1000],i,j,m,k;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>N;
k=0;
for(i=1;i<=N;i++)
f>>a[i];
sort(a+1,a+N+1);
for(i=1;i<N-1;i++)
for(j=i+1;j<N;j++)
for(m=j+1;m<=N;m++)
if (a[i]+a[j]>=a[m] && a[j]+a[m]>=a[i] && a[m]+a[i]>=a[j])
k++;
else break;
g<<k;
return 0;
}