Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int cautare(int x, int V[], int n){
- int st=1, dr=n, mij;
- while(st<=dr){
- mij=(st+dr)/2;
- if(V[mij]==x) return 1;
- else {
- if(V[mij]>x) dr=mij-1;
- else st=mij+1;
- }
- }
- return 0;
- }
- int main(){
- int n,m,x[25001],y,i;
- cin >> n;
- for(i=1;i<=n;i++) cin >> x[i];
- cin >> m;
- for(i=1;i<=m;i++){ cin >> y;
- cout << cautare(y,x,n) << " ";
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement