Cod sursa(job #1724804)

Utilizator mjmilan11Mujdar Milan mjmilan11 Data 4 iulie 2016 12:11:26
Problema Cautare binara Scor 40
Compilator cpp Status done
Runda Arhiva educationala Marime 1.06 kb
#include <iostream>
#include <fstream>
using namespace std;

int n,v[100001];

int caut0(int x)
{
    int i=0,pas=(1<<16);
    while(pas!=0)
    {
        if(i+pas<=n && v[i+pas]<=x)
            i+=pas;
        pas/=2;
    }
    if(v[i]==x)
        return i;
    return -1;
}

int caut1(int x)
{
    int i=0,pas=(1<<16);
    while (pas!=0)
    {
        if(i+pas<=n && v[i+pas]<=x)
            i+=pas;
        pas/=2;
    }
    return i;
}

int caut2(int x)
{
    int i=0, pas=(1<<16);
    while (pas!=0)
    {
        if(i+pas<=n && v[i+pas]<x)
            i+=pas;
        pas/=2;
    }
    return 1+i;
}

int main()
{
    int i, t, k, c;
    ifstream fin("cautbin.in");
    ofstream fout("cautbin.out");
    fin >> n;
    for(i=1; i<=n; i++)
        fin>>v[i];
    fin >> t;
    for(i=0; i<t; i++)
    {
        fin >> k >> c;
        if (k==0)
            fout << caut0(c);
        if (k==1)
            fout << caut1(c);
        if (k==2)
            fout << caut2(c);
        fout << endl;
    }
    return 0;
}