π λ°±μ€ μκ³ λ¦¬μ¦ ν μ 1065λ²
https://www.acmicpc.net/problem/1065
π‘ νμ΄
temp = int(input())
result = [x for x in range(1, temp + 1)]
cnt = 0
def fun1(result):
global cnt
while result:
num = str(result.pop())
if len(num) == 1 or len(num) == 2:
cnt += 1
continue
num_list = [int(x) for x in num]
if num_list[1] - num_list[0] == num_list[2] - num_list[1]:
cnt += 1
return cnt
print(fun1(result))
π ν΄μ€
λ±ν ν΄μ€ λΆλΆμ΄ μλ κ²κ°λ€.
μ λ ₯κ°μ΄ 1000 μ΄νμλλ° λ§μ½ μλ¦Ώμκ° λ§μμ§λ€λ©΄num_list[1] - num_list[0] == num_list[2] - num_list[1]:
μμ κ°μ μμΌλ‘ μ§λ©΄ μλλ€.
νμ§λ§ μλ¦Ώμκ° 3μ리 μ΄νλκΉ... 1, 2μ리λ cnt += 1 μ²λ¦¬λ₯Ό νκ³ 3μ리λ μ if λ¬Έμ κ±Έλ¦¬κ² νμλ€.
π μλ μ λ ₯μ΄ λ€μ΄μμλ κ°μ₯ λ§μ΄ μ λ ₯λ μνλ²³ μΆλ ₯
input = "hello my name is sparta"
π‘ νμ΄
from collections import defaultdict
input = "hello my name is sparta"
def find_max_occurred_alphabet(string):
result = defaultdict(int)
string = ''.join(string.split())
for i in string:
result[i] += 1
test = [[key, val] for key, val in result.items()]
temp = test[0]
for x, y in test:
if temp[1] <= y:
temp[0], temp[1] = x, y
return temp[0]
result = find_max_occurred_alphabet(input)
print(result)
π ν΄μ€
- defaultdict(int) λ‘ 0μΌλ‘ μ΄κΈ°νλ dictionaryλ₯Ό λ§λ ν split() ν¨μλ‘ λΉ λ¬Έμλ₯Ό μλΌ μ£Όμλ€
- κ·Έ λ€μ resultμ μ μ₯λ μνλ²³λ€μ λ리며 tempμ 첫 λ¬Έμλ₯Ό μ μ₯ ν μ΅λκ° μ°Ύμ ν μΆλ ₯