Pagini recente » Cod sursa (job #1125178) | Cod sursa (job #698684) | Cod sursa (job #1566756) | Cod sursa (job #2782800) | Cod sursa (job #1364971)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n, v[805], cnt;
int cautare(int st, int dr, int caut)
{
int mij;
while(st <= dr)
{
mij = (st + dr)/2;
if(v[mij] <= caut)
st = mij + 1;
else
if(v[mij] > caut )
dr = mij - 1;
}
while ( caut < v[mij] )
mij--;
return mij;
}
int main()
{
fin>>n;
for(int i = 1; i <= n; i++)
fin>>v[i];
for(int i = 1; i <= n - 1 ; i++)
for(int j = i + 1; j <= n; j++)
{
int vc = cautare(j + 1 , n , v[i]+v[j]);
cnt += vc - j;
}
fout<<cnt;
return 0;
}