Pagini recente » Cod sursa (job #969747) | Cod sursa (job #2087644) | Cod sursa (job #1204492) | Cod sursa (job #2227715) | Cod sursa (job #1792219)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n;
vector<int> v;
int CautareBinara(int st, int dr, int x)
{
if (st <= dr)
{
int mij = st + (dr - st) / 2;
if (v[mij] == x)
return mij;
else if (v[mij] > x)
return CautareBinara(st, mij - 1, x);
else
return CautareBinara(mij + 1, dr, x);
}
return dr;
}
int main()
{
int sum = 0;
f >> n;
v.resize(n);
for (int i = 0; i < n; ++i)
f >> v[i];
for (int i = 0; i < n - 1; ++i)
for (int j = i + 1; j < n; ++j)
sum += n - CautareBinara(j, n - 1, v[i] + v[j]) - 1;
g << sum;
return 0;
}