intbinsearch(int x,int *v, int n) { //这里注意一下,传递过来的数组长度是不能计算的,贼坑 //int length = sizeof(v) / sizeof(v[0]); int result = -1; for (size_t i = 0; i < n; i++) { if (x == v[i]) result = v[i]; if (i==n-1) { break; } } return result; }
main:
int arr[] = { 1,2,3,4,5,6,7,8,9,10,11,12,13,14 }; int result = binsearch(13,arr,100); printf("%d\n", result);
for (size_t i = 0; i < 10; i++) { if (i == 9) break; if (i != 9) printf("\n"); for (size_t j = 0; j < i; j++) { printf(" "); } for (size_t j = 10; j > i; j--) { printf("**"); }
} for (size_t i = 0; i < 10; i++) { for (size_t j = 10; j > i; j--) { printf(" "); } for (size_t j = 0; j < i; j++) { printf("**"); } if (i != 9) printf("\n");
}
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
intmain() { char pwd[20] = { 0 }; int num = 0; while (num < 3) { printf("请输入密码:"); scanf("%s", pwd); if (strcmp("123456",pwd)!= 0) { printf("%s\n", pwd); num++; } else { printf("输入正确!"); } }; return0; }