| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 110284 | 王璇公·传统美德 | 折半查找法 | C++ | Accepted | 100 | 1 MS | 296 KB | 294 | 2023-11-14 13:08:38 |
#include<bits/stdc++.h> using namespace std ; int n , a [10005] , m ; int main ( ) { cin >> n ; for ( int i = 1 ; i <= n ; i++ ) { cin >> a [i]; } cin >> m; for ( int i = 1 ; i <= n ; i++ ) { if( a [i] == m){ cout << i; return 0; } } cout << -1; return 0; }