vlambda博客
学习文章列表

#include <stdio.h>

int binarySearch(int x, int num[], int begin, int end) { int mid; while (begin <= end) { mid = (begin + end + 1) / 2; if (x == num[mid]) return mid; else if (x > num[mid]) begin = mid + 1; else end = mid - 1; } return -1;}
void main() {
 int i,n, m; int num[10000],temp[50000]; scanf("%d",&n); for (i = 0; i < n; i++) { scanf("%d",&num[i]); } scanf("%d\n",&m); for (i = 0; i < m; i++) { scanf("%d",&temp[i]); } for (i = 0; i < m; i++){ if (binarySearch(temp[i], num, 0, n - 1) != -1) printf("Yes\n"); else printf("No\n"); }
}