Problem Solving/BOJ & Programmers
[BOJ] 1065λ²: νμ
geum
2024. 9. 28. 21:24
βοΈ λ¬Έμ
μ΄λ€ μμ μ μ Xμ κ° μλ¦¬κ° λ±μ°¨μμ΄μ μ΄λ£¬λ€λ©΄, κ·Έ μλ₯Ό νμλΌκ³ νλ€. λ±μ°¨μμ΄μ μ°μλ λ κ°μ μμ μ°¨μ΄κ° μΌμ ν μμ΄μ λ§νλ€. Nμ΄ μ£Όμ΄μ‘μ λ, 1λ³΄λ€ ν¬κ±°λ κ°κ³ , Nλ³΄λ€ μκ±°λ κ°μ νμμ κ°μλ₯Ό μΆλ ₯νλ νλ‘κ·Έλ¨μ μμ±νμμ€.
π€ μ μΆλ ₯ μμ
π‘νμ΄
κ³΅μ°¨κ° 0 μ΄νμΈ κ²½μ°λ₯Ό λμΉκ³ μλ€κ° μ! μΆμ΄μ μ½λμ λ°μνλκΉ λ°λ‘ νλ Έλ€.
han_numbers = [False]*1001
for i in range(1, 1001):
if i < 100:
han_numbers[i] = True
elif i < 1000:
left = int(str(i)[0])-int(str(i)[1])
right = int(str(i)[1])-int(str(i)[2])
if left == right:
han_numbers[i] = True
N = int(input())
answer = 0
for i in range(1, N+1):
if han_numbers[i]:
answer += 1
print(answer)