| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 75104 | yulongzheng | 珠子计算 | C++ | Wrong Answer | 0 | 0 MS | 244 KB | 392 | 2023-06-28 10:45:32 |
#include<bits/stdc++.h> using namespace std; int ball[81]; int main(){ int n, ans=0; cin >> n; for(int i = 0; i < n; i ++) { cin >> ball[i]; } if (n < 2) { ans = 1; }else { for (int i = 0; i < n / 2; i ++){ if (ball[2*i] != ball[2*i+1]) { ans ++; } } } cout << ans << endl; return 0; }