Submission #3789383
Source Code Expand
#include <iostream> #include <cmath> #include <string> #include <algorithm> using namespace std; bool func(int N) { string n = to_string(N); int size = (int)(n.size()); bool flag = true; for(int i=0; i<size/2; ++i) { if(n[i]!=n[size-i-1]) { flag = false; break; } } return flag; } int main() { int A, B, res = 0; cin >> A >> B; for(int i=A; i<B; ++i) { if(func(i)) ++res; } cout << res << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Palindromic Numbers |
User | Kuromaru |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 495 Byte |
Status | WA |
Exec Time | 14 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 200 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | WA | 14 ms | 256 KB |
02.txt | WA | 14 ms | 256 KB |
03.txt | AC | 14 ms | 256 KB |
04.txt | AC | 8 ms | 256 KB |
05.txt | AC | 6 ms | 256 KB |
06.txt | AC | 5 ms | 256 KB |
07.txt | WA | 14 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 10 ms | 256 KB |