Pagini recente » Cod sursa (job #48603) | Cod sursa (job #2517075) | Cod sursa (job #297226) | Cod sursa (job #360467) | Cod sursa (job #2166970)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100],n;
int cautare_bin0(int nrc)
{
int st,dr,mid;
st=0;
dr=n-1;
while(st<dr)
{
mid=st+(dr-st)/2+1;
if(nrc==v[mid])
{
while(v[mid+1]==nrc)
++mid;
return mid;
}
if(nrc>mid)
st=mid;
else
dr=mid-1;
}
return -1;
}
int cautare_bin1(int nrc)
{
int st,dr,mid;
st=0;
dr=n-1;
while(st<dr)
{
mid=st+(dr-st)/2+1;
if(nrc==v[mid])
{
while(v[mid+1]==nrc)
++mid;
return mid;
}
if(nrc>mid)
st=mid;
else
dr=mid-1;
}
return mid;
}
int cautare_bin2(int nrc)
{
int st,dr,mid;
st=0;
dr=n-1;
while(st<dr)
{
mid=st+(dr-st)/2+1;
if(nrc==v[mid])
{
while(v[mid+1]==nrc)
++mid;
return mid;
}
if(nrc>mid)
st=mid;
else
dr=mid-1;
}
return mid;
}
int main()
{
int m,i,q,x;
f>>n;
for(i=0;i<n;i++)
f>>v[i];
f>>m;
for(i=0;i<m;i++)
{
f>>q>>x;
//g<<x<<endl;
if(q==0)
g<<cautare_bin0(x)+1<<endl;
else
if(q==1)
g<<cautare_bin1(x)+1<<endl;
else
g<<cautare_bin2(x)+1<<endl;
}
return 0;
}