Submission #2190622
Source Code Expand
#coding=utf-8
def check_circle(s):
x = str(s)
flag = True
for i in range(int(len(x) / 2)):
if x[i] != x[-1 * (i + 1)]:
flag = False
return flag
def solve(A, B):
count = 0
for y in range(A, B + 1):
if check_circle(y):
count += 1
return count
def main():
A, B = input().split(' ')
print(solve(int(A), int(B)))
if __name__ == '__main__':
main()
Submission Info
| Submission Time | |
|---|---|
| Task | B - Palindromic Numbers |
| User | rerost |
| Language | Python (3.4.3) |
| Score | 200 |
| Code Size | 458 Byte |
| Status | AC |
| Exec Time | 112 ms |
| Memory | 3064 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 200 / 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 | AC | 112 ms | 2940 KiB |
| 02.txt | AC | 110 ms | 2940 KiB |
| 03.txt | AC | 106 ms | 2940 KiB |
| 04.txt | AC | 67 ms | 2940 KiB |
| 05.txt | AC | 55 ms | 3064 KiB |
| 06.txt | AC | 47 ms | 2940 KiB |
| 07.txt | AC | 111 ms | 3060 KiB |
| 08.txt | AC | 18 ms | 2940 KiB |
| s1.txt | AC | 19 ms | 3060 KiB |
| s2.txt | AC | 85 ms | 2936 KiB |