Pagini recente » Cod sursa (job #2093204) | Cod sursa (job #2324264) | Cod sursa (job #1324804) | Cod sursa (job #250724) | Cod sursa (job #1527519)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int N = 100001, L = 16;
int v[N], n;
int caut0(int x)
{
int i, pas;
pas=1<<L;
i=0;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
if(v[i]==x)
return i;
else
return -1;
}
int caut1(int x)
{
int i, pas;
pas=1<<L;
i=0;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
return i;
}
int caut2(int x)
{
int i, pas;
pas=1<<L;
i=0;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<x)
i+=pas;
pas/=2;
}
return 1 + i;
}
int main()
{
int i,m,y,tip;
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
in>>m;
for(i=1;i<=m;i++){
in >> tip >> y;
if (tip == 0)
out << caut0(y);
if (tip == 1)
out << caut1(y);
if (tip == 2)
out << caut2(y);
out << "\n";
}
return 0;
}