Pagini recente » Cod sursa (job #693126) | Cod sursa (job #233575) | Cod sursa (job #529537) | Cod sursa (job #1388613) | Cod sursa (job #513878)
Cod sursa(job #513878)
#include <stdio.h>
FILE *f,*g;
int n,m,v[10001];
int search(int t,int a)
{int u,p,mij,poz=-1;
p=1; u=n;
if(t==0)
{while(p<=u)
{mij=(p+u)/2;
if(v[mij]==a)
{poz=mij;
p=mij+1;
}
else if(v[mij]>a)
u=mij-1;
else if(v[mij]<a)
p=mij+1;
}
}
else if(t==1)
{while(p<=u)
{mij=(p+u)/2;
if(v[mij]<=a)
{poz=mij;
p=mij+1;
}
else if(v[mij]>a)
u=mij-1;
}
}
else if(t==2)
{while(p<=u)
{mij=(p+u)/2;
if(v[mij]>=a)
{poz=mij;
u=mij-1;
}
else if(v[mij]<a)
p=mij+1;
}
}
return poz;
}
int main()
{int i,j;
f=fopen("cautbin.in","r");
g=fopen("cautbin.out","w");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
fscanf(f,"%d",&v[i]);
fscanf(f,"%d",&m);
int q;
short t;
int r;
for(i=1;i<=m;i++)
{fscanf(f,"%d %d",&t,&q);
r=search(t,q);
fprintf(g,"%d\n",r);
}
fclose(f);
fclose(g);
return 0;
}