QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#205271 | #5422. Perfect Palindrome | trisolaris | WA | 0ms | 3676kb | C++20 | 353b | 2023-10-07 15:21:30 | 2023-10-07 15:21:30 |
Judging History
answer
#include <bits/stdc++.h>
const int N = 3e5 + 10;
typedef long long ll;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::string s;
std::cin >> s;
int cnt = 0;
for(int i = 0; i < s.size(); i++)
if(s[i] != s[s.size() - 1 - i])
++cnt;
std::cout << cnt << "\n";
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3676kb
input:
2 abcb xxx
output:
0
result:
wrong answer 1st numbers differ - expected: '2', found: '0'