Cod sursa(job #786553)

Utilizator sinio1Stirbat Luca sinio1 Data 11 septembrie 2012 16:30:21
Problema Cautare binara Scor 60
Compilator c Status done
Runda Arhiva educationala Marime 1.28 kb
#include <stdio.h>
#include <stdlib.h>
#define K 16
#define W 1000000
int v[W];
int cautb0 (int x,int n)
{
    int i=0,pas=1<<K;
    while (pas!=0)
    {
        if (i+pas<n&&v[i+pas]<=x)
            i+=pas;
        pas/=2;
    }
    if(v[i] == x)
        return i;
    else
        return -2;
}
int cautb1 (int x,int n)
{
    int i=0,pas=1<<K;
    while (pas!=0)
    {
        if (i+pas<n&&v[i+pas]<=x)
            i+=pas;
        pas/=2;
    }
    return i;
}
int cautb2 (int x, int n)
{
    int i=0,pas=1<<K;
    while (pas!=0)
    {
        if (i+pas<n&&v[i+pas]<x)
            i+=pas;
        pas/=2;
    }
    return 1+i;
}

int main()
{
    FILE * fin, *fout;
    fin=fopen("cautbin.in","r");
    fout=fopen("cautbin.out","w");

    int n,i,nri,intrebare,x,d;
    fscanf(fin,"%d",&n);
    for (i=0; i<n; i++)
    {
         fscanf(fin,"%d",&v[i]);
    }
    fscanf(fin,"%d",&nri);
    for (i=1; i<=nri; i++)
    {
        fscanf(fin,"%d",&intrebare);
        fscanf(fin,"%d",&x);
        if (intrebare==0)
            d=cautb0(x,n);
        if (intrebare==1)
            d=cautb1(x,n);
        if (intrebare==2)
            d=cautb2(x,n);
        fprintf (fout,"%d\n",d + 1);
    }

    fclose(fin);
    fclose(fout);
    return 0;
}