| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1120430 | vjudge1 | Palindrome-Free Numbers (BOI13_numbers) | Cpython 3 | 1093 ms | 3068 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
# author - alimammadzade
a, b = map(int, input().split())
res = 0
def free(n):
a = str(n)
for i in range(len(a) - 1):
for j in range(i + 1, len(a)):
b = a[i : j + 1]
if b == b[::-1]:
return False
return True
for i in range(a, b + 1):
if free(i):
res += 1
print(res)| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
