Pagini recente » Borderou de evaluare (job #1328072) | Borderou de evaluare (job #1923279) | Borderou de evaluare (job #1566631) | Cod sursa (job #1468962) | Cod sursa (job #2289071)
#include <iostream>
using namespace std;
int main()
{
int n,s,d,m,ok=0,a[25001],i,k,x;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
cin>>k;
for(i=1;i<=k;i++)
{
s=1;d=n;ok=0;
cin>>x;
while(s<=d)
{
m=(s+d)/2;
if(a[m]==x)
{
ok=m;
break;
}
else
if(x<a[m])
d=m-1;
else
s=m+1;
}
if(ok==1)
cout<<1<<" ";
else
cout<<0<<" ";
}
return 0;
}