| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 42542 | 惠子铭 | 计算鞍点 | C++ | Wrong Answer | 1 MS | 184 KB | 414 | 2024-03-01 15:47:01 |
#include <cstdio> #define maxn 110 int arr[maxn]; int main() { //freopen("D:\\temp\\test\\tmp.txt", "r", stdin); int n, m; int counter = 0; scanf("%d", &n); for(int i=0; i<n; i++) { scanf("%d", &arr[i]); } scanf("%d", &m); for(int i=0; i<n; i++) { if(arr[i] == m) counter++; } printf("%d\n", counter); return 0; }