Pagini recente » Cod sursa (job #2896661) | Cod sursa (job #2585929) | Cod sursa (job #2473597) | Cod sursa (job #948357) | Cod sursa (job #1536271)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream f2("nrtri.out");
#define NMAX 820
int a[NMAX];
int main()
{
int n, i, j;
f >> n;
for (i=1; i<=n; i++)
f>>a[i];
sort(a+1, a+n+1);
int n_total= 0;
for (i=1; i<n; i++)
for (j= i+1; j<=n; j++)
{
int val= a[i]+a[j];
int nr= upper_bound(a+1, a+n+1, val ) - a;
if (a[nr] > val || nr > n)
nr--;
nr-= j;
n_total+= nr;
}
f2 << n_total;
f2.close();
return 0;
}