Pagini recente » Cod sursa (job #1769607) | Cod sursa (job #218636) | Cod sursa (job #1550340) | Cod sursa (job #189005) | Cod sursa (job #2291195)
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout ("nrtri.out");
int n, v[801], k;
void citire()
{
fin >> n;
for (int i = 0; i < n; ++i)
fin >> v[i];
}
int cautare_binara(int x, int s)
{
int st = s, dr = n - 1;
while (st <= dr)
{
int mid = (st + dr) / 2;
if (v[mid] < x)
st = mid + 1;
else
dr = mid - 1;
}
if (v[st] == x)
return st;
return st - 1;
}
void rezolvare()
{
sort(v, v + n);
for (int i = 0; i < n - 2; ++i)
for (int j = i + 1; j < n - 1; ++j)
k += cautare_binara(v[i] + v[j], j + 1) - j;
fout << k;
}
int main()
{
citire();
rezolvare();
return 0;
}