QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #430007 | #5422. Perfect Palindrome | s1amese | WA | 4ms | 4108kb | C++20 | 391b | 2024-06-03 10:29:01 | 2024-06-03 10:29:02 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
void solve() {
string s;
cin >> s;
int n = s.size(), ans = 0;
for (int i = 0; i < n / 2; i++)
if (s[i] != s[n - i - 1])
++ans;
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t;
cin >> t;
while (t--)
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3632kb
input:
2 abcb xxx
output:
2 0
result:
ok 2 number(s): "2 0"
Test #2:
score: -100
Wrong Answer
time: 4ms
memory: 4108kb
input:
11107 lfpbavjsm pdtlkfwn fmb hptdswsoul bhyjhp pscfliuqn nej nxolzbd z clzb zqomviosz u ek vco oymonrq rjd ktsqti mdcvserv x birnpfu gsgk ftchwlm bzqgar ovj nsgiegk dbolme nvr rpsc fprodu eqtidwto j qty o jknssmabwl qjfv wrd aa ejsf i npmmhkef dzvyon p zww dp ru qmwm sc wnnjyoepxo hc opvfepiko inuxx...
output:
4 4 1 5 2 4 1 3 0 2 2 0 1 1 3 1 2 4 0 3 2 3 3 1 3 3 1 2 3 4 0 1 0 5 2 1 0 2 0 4 3 0 1 1 1 2 1 5 1 3 3 2 2 3 1 4 3 3 4 4 3 2 0 1 2 1 1 3 0 0 5 2 2 3 5 2 0 3 1 3 3 0 4 4 2 2 5 2 3 1 3 4 5 4 3 1 3 2 1 4 2 4 4 2 2 5 4 5 2 5 2 5 0 3 4 1 4 0 0 3 3 0 4 2 2 1 1 4 4 3 1 3 3 4 2 2 1 3 2 5 4 0 2 3 1 1 2 0 3 5 ...
result:
wrong answer 1st numbers differ - expected: '8', found: '4'