Pagini recente » Cod sursa (job #2525058) | Cod sursa (job #2221003) | Cod sursa (job #981783) | Cod sursa (job #839507) | Cod sursa (job #2066102)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
/* //cautbinara : a<<b=a*2^b;
pas=1<<l;
r=0;
while(pas!=0)
{
if(r+pas are propr)
{
r+=pas;
}
pas/=2; //pas>>1
}
r este ultimul care are propr*/
const int N=100010;
int v[N],x,n,m,pas,r,l,nr_probl,i;
int caut_bin_0()
{
pas=1<<l;
r=0;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
if(v[r]!=x)
{
return -1;
}
else
return r;
}
int caut_bin_1()
{
pas=1<<l;
r=0;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
return r;
}
int caut_bin_2()
{
pas=1<<l;
r=0;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<x)
{
r+=pas;
}
pas/=2;
}
r++;
return r;
}
int main()
{
l=16;
f>>n;
for(i=1; i<=n; i++)
f>>v[i];
f>>m;
for(i=1; i<=m; i++)
{
f>>nr_probl>>x;
if(nr_probl==0)
{
g<<caut_bin_0()<<"\n";
}
if(nr_probl==1)
{
g<<caut_bin_1()<<"\n";
}
if(nr_probl==2)
{
g<<caut_bin_2()<<"\n";
}
}
return 0;
}