Submission #11314824
Source Code Expand
#include <iostream>
using namespace std;
int main(){
string s;
cin >> s;
int count = 0;
for(int i = 0;i < s.length();i++){
if(s[s.length() - (i + 1)] != s[i]){
count++;
}
}
cout << count / 2 << endl;
}
Submission Info
| Submission Time | |
|---|---|
| Task | B - Palindrome-philia |
| User | sikeking |
| Language | C++14 (GCC 5.4.1) |
| Score | 200 |
| Code Size | 271 Byte |
| Status | AC |
| Exec Time | 1 ms |
| Memory | 256 KiB |
Judge Result
| Set Name | Sample | Subtask1 | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 200 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01.txt, sample_02.txt, sample_03.txt |
| Subtask1 | sample_01.txt, sample_02.txt, sample_03.txt, sub1_01.txt, sub1_02.txt, sub1_03.txt, sub1_04.txt, sub1_05.txt, sub1_06.txt, sub1_07.txt, sub1_08.txt, sub1_09.txt, sub1_10.txt, sub1_11.txt, sub1_12.txt, sub1_13.txt, sub1_14.txt, sub1_15.txt, sub1_16.txt, sub1_17.txt, sub1_18.txt, sub1_19.txt, sub1_20.txt |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| sample_01.txt | AC | 1 ms | 256 KiB |
| sample_02.txt | AC | 1 ms | 256 KiB |
| sample_03.txt | AC | 1 ms | 256 KiB |
| sub1_01.txt | AC | 1 ms | 256 KiB |
| sub1_02.txt | AC | 1 ms | 256 KiB |
| sub1_03.txt | AC | 1 ms | 256 KiB |
| sub1_04.txt | AC | 1 ms | 256 KiB |
| sub1_05.txt | AC | 1 ms | 256 KiB |
| sub1_06.txt | AC | 1 ms | 256 KiB |
| sub1_07.txt | AC | 1 ms | 256 KiB |
| sub1_08.txt | AC | 1 ms | 256 KiB |
| sub1_09.txt | AC | 1 ms | 256 KiB |
| sub1_10.txt | AC | 1 ms | 256 KiB |
| sub1_11.txt | AC | 1 ms | 256 KiB |
| sub1_12.txt | AC | 1 ms | 256 KiB |
| sub1_13.txt | AC | 1 ms | 256 KiB |
| sub1_14.txt | AC | 1 ms | 256 KiB |
| sub1_15.txt | AC | 1 ms | 256 KiB |
| sub1_16.txt | AC | 1 ms | 256 KiB |
| sub1_17.txt | AC | 1 ms | 256 KiB |
| sub1_18.txt | AC | 1 ms | 256 KiB |
| sub1_19.txt | AC | 1 ms | 256 KiB |
| sub1_20.txt | AC | 1 ms | 256 KiB |