Pagini recente » Cod sursa (job #1321005) | Rating Tudor Tentiu (tudtentiu28) | Monitorul de evaluare | Cod sursa (job #1519520) | Cod sursa (job #1493058)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("cautbin.in");
ofstream g("cautbin.out");
int v[100];
int main()
{
int low,high,mid,x,n,q,pos;
f>>n>>q;
for(int i=1;i<=n;i++)
f>>v[i];
for(int i=1;i<=q;i++)
{
f>>x;
low=1;
high=n;
while(low<=high)
{
mid = (low+high)/2;
if(v[mid]==x)
{
pos=mid;
}
if(v[mid]>x)
high=mid-1;
else
low=mid+1;
}
g<<pos;
}
return 0;
}