| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 127188 | 梁思宸 | 折半查找法 | C++ | Wrong Answer | 90 | 1 MS | 320 KB | 406 | 2024-01-25 08:18:57 |
#include <bits/stdc++.h> using namespace std; int a[10010]; int n, m; int main (){ ios::sync_with_stdio(false); cin.tie(0); scanf("%d", &n); for (int i = 1; i <= n; i++){ scanf("%d", &a[i]); } scanf("%d", &m); if (m > 10000){ printf("-1"); return 0; } for (int i = 1; i <= n; i++){ if (a[i] == m){ printf("%d", i); return 0; } } printf("-1"); return 0; }