Nu aveti permisiuni pentru a descarca fisierul grader_test1.in
Cod sursa(job #1913427)
| Utilizator | Data | 8 martie 2017 12:51:11 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 1.15 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("cautbin.in");
ofstream out("cautbin.out");
const int L = 16;
int n;
int v[100001];
int c0(int x)
{
int pas;
pas=1<<L;
int r=0;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
if (v[r] != x)
{
r=-1;
}
return r;
}
int c1(int x)
{
int pas;
pas=1<<L;
int r=0;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<=x)
{
r+=pas;
}
pas/=2;
}
return r;
}
int c2(int x)
{
int pas;
pas=1<<L;
int r=0;
while(pas!=0)
{
if(r+pas<=n && v[r+pas]<x)
{
r+=pas;
}
pas/=2;
}
return r+1;
}
int main()
{
int x,k,c;
in>>n;
for(int p=1 ; p<=n ; p++)
{
in>>v[p];
}
in>>k;
while(k>0)
{
in>>c;
in>>x;
if(c==0)
{
out<<c0(x)<<"\n";
}
if(c==1)
{
out<<c1(x)<<"\n";
}
if(c==2)
{
out<<c2(x)<<"\n";
}
k--;
}
return 0;
}
