Pagini recente » Istoria paginii runda/ultimaadmine | Cod sursa (job #822366) | Cod sursa (job #1795599) | Cod sursa (job #2443347) | Cod sursa (job #1384804)
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int k = 16;
int v[100001], n;
int caut0(int x)
{
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 -1;
}
int caut1(int x)
{
int i=0, pas=1<<k;
while(pas!=0)
{
if(i+pas<=n && v[i+pas]<=x)
i+=pas;
pas/=2;
}
return i;
}
int caut2(int x)
{
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()
{
int j, i, m, x, w;
in>>n;
for(j=1; j<=n; j++)
in>>v[j];
in>>m;
for(i=1; i<=m; i++)
{
in>>w>>x;
if(w==0)
out << caut0(x) << endl;
if(w==1)
out << caut1(x) << endl;
if(w==2)
out << caut2(x) << endl;
}
return 0;
}