Pagini recente » Cod sursa (job #2644802) | Cod sursa (job #2567924) | Cod sursa (job #1605146) | Cod sursa (job #2332498) | Cod sursa (job #1527535)
#include <fstream>
using namespace std;
ifstream in ("cautbin.in");
ofstream out ("cautbin.out");
int v[100001],n;
int rez0 ( int x)
{
int pas, i ;
pas = 1<<16;
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 rez1 ( int x)
{
int pas, i;
pas = 1<<16;
i=0;
while ( pas!=0)
{
if ( i+pas <= n && v [i+pas]<=x)
i+=pas;
pas/=2;
}
return i;
}
int rez2 (int x)
{
int pas, i;
pas = 1<<16;
i=0;
while ( pas!=0)
{
if ( i+pas <= n && v [i+pas]<x )
i+=pas;
pas/=2;
}
return i+1;
}
int main()
{
int i, m,intr, x, j;
in>>n;
for ( i=1; i<=n; i++)
in>>v[i];
in>>m;
for (j=0; j<m; j++)
{
in>>intr>>x;
if ( intr == 0)
out<< rez0(x)<<"\n";
if ( intr == 1)
out<< rez1(x)<<"\n";
if ( intr == 2)
out<<rez2(x)<<"\n";;
}
return 0;
}