Cod sursa(job #2966241)
Utilizator | David Preda David2007 | Data | 16 ianuarie 2023 21:47:32 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.79 kb |
#include <bits/stdc++.h>
using namespace std;
fstream f("nrtri.in",ios::in);
fstream g("nrtri.out",ios::out);
int n,i,j,nr,a;
int v[1000];
int CautareBinara(int st,int dr,int x)
{
int poz,mij;
poz=0;
while(st<=dr)
{
mij=(st+dr)/2;
if(v[mij]>x)
dr=mij-1;
else
{
poz=mij;
st=mij+1;
}
}
return poz;
}
int main()
{
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
sort(v+1,v+1+n);
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
a=CautareBinara(1,n,v[i]+v[j]);
if(a>j)
{
nr=nr+a-j+1;
i++;
j=i+1;
}
}
}
g<<nr;
return 0;
}