Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- using namespace std;
- int BusquedaBinaria(int a[],int n,int c)
- {
- int cont=0;
- int pi=0, pf=n-1;
- while(pi<pf+1)
- {
- int pmed= (pf+pi)/2;
- if(a[pmed]>c)
- {
- cont++;
- pf=pmed;
- }
- if(a[pmed]<=c)
- pi=pmed;
- if(pi==pf)
- break;
- pi++;
- }
- return cont;
- }
- int main() {
- int n;
- while(cin>>n)
- {
- if(n<=0)
- break;
- int contador=0;
- int a[n];
- for(int i=0;i<n;i++)
- cin>>a[i];
- sort(a,a+n);
- for(int i=0;i<n-1;i++)
- {
- for(int j=i+1;j<n;j++)
- contador+=BusquedaBinaria(a,n,a[i]+a[j]);
- }
- cout<< contador<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement