40 lines
1017 B
Python
40 lines
1017 B
Python
# HumanEval/107
|
|
# Loki Mode Multi-Agent Solution
|
|
# Attempts: 1
|
|
# Passed: True
|
|
|
|
def even_odd_palindrome(n):
|
|
"""
|
|
Given a positive integer n, return a tuple that has the number of even and odd
|
|
integer palindromes that fall within the range(1, n), inclusive.
|
|
|
|
Example 1:
|
|
|
|
Input: 3
|
|
Output: (1, 2)
|
|
Explanation:
|
|
Integer palindrome are 1, 2, 3. one of them is even, and two of them are odd.
|
|
|
|
Example 2:
|
|
|
|
Input: 12
|
|
Output: (4, 6)
|
|
Explanation:
|
|
Integer palindrome are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11. four of them are even, and 6 of them are odd.
|
|
|
|
Note:
|
|
1. 1 <= n <= 10^3
|
|
2. returned tuple has the number of even and odd integer palindromes respectively.
|
|
"""
|
|
even_count = 0
|
|
odd_count = 0
|
|
|
|
for i in range(1, n + 1):
|
|
s = str(i)
|
|
if s == s[::-1]:
|
|
if i % 2 == 0:
|
|
even_count += 1
|
|
else:
|
|
odd_count += 1
|
|
|
|
return (even_count, odd_count) |