[PY] 백준 10988 팰린드롬인지 확인하기

n=input() a=list(n) m=list(reversed(a)) ans=1 for i in range(len(a)): if a[i]!=m[i]: ans=0 break print(ans)

• format_list_bulleted coding/baekjoon: python
• · 2024. 1. 10.

[PY] 백준 3020 개똥벌레

n,h=map(int,input().split()) a=[0]*(h+1) b=[0]*(h+1) min=n count=0 for i in range(n): if i%2==0: a[int(input())]+=1 else: b[int(input())]+=1 for i in range(h-1,0,-1): a[i]+=a[i+1] b[i]+=b[i+1] for i in range(1, h+1): if min>(a[i]+b[h-i+1]): min=a[i]+b[h-i+1] count=1 elif min == (a[i]+b[h-i+1]): count+=1 print(min,count)

• format_list_bulleted coding/baekjoon: python
• · 2024. 1. 10.

[PY] 백준 1157 단어 공부

n=input().lower() nlist=list(set(n)) #중복 없음 cnt=[] for i in nlist: c=n.count(i) cnt.append(c) if cnt.count(max(cnt)) >1: print("?") else: print(nlist[(cnt.index(max(cnt)))].upper())

• format_list_bulleted coding/baekjoon: python
• · 2024. 1. 7.

[PY] 백준 25206 너의 평점은

a=['']*20 b=[0]*20 c=[0]*20 cnt=0 for i in range(20): a[i],e,f=input().split() b[i]=float(e) if f=='P': b[i]=0 continue if f=='F': c[i]=0 cnt+=1 continue list(f) c[i]=4-(ord(f[0])%65) if f[1]=='+': c[i]+=0.5 c[i]*=b[i] print(sum(c)/sum(b))

• format_list_bulleted coding/baekjoon: python
• · 2024. 1. 7.