python-algorithm1422 [백준] 2747 1 2 3 4 5 6 7 8 9 10 11 import sys fibotmp=[0]*100 def fibo(n): if n 2020. 12. 22. [백준] 2720 1 2 3 4 5 6 7 import sys for _ in range (int(sys.stdin.readline())): change=int(sys.stdin.readline()) a=change//25; change%=25 b=change//10; change%=10 c=change//5; d=change%5 print("%d %d %d %d"%(a,b,c,d)) cs 2020. 12. 22. [백준] 2576 1 2 3 4 5 6 7 8 mylist=[] for _ in range(7): n=int(input()) if n%2==1: mylist.append(n) if not mylist:print(-1) else : print(sum(mylist)) print (min(mylist)) cs 입력 갯수가 7개로 고정이고 홀수면 list 에 append 하고 sum과 min 함수를 이용해서 출력합니다. 2020. 12. 22. [백준] 2566 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 import sys anstmp=[] ans=[] for i in range(9): tmp=list(map(int, sys.stdin.readline().split())) tmpMax=max(tmp) for j in range(9): if tmp[j]==tmpMax: anstmp.append( (i+1,j+1)); ans.append(tmpMax) finalMax=max( ans) for i in range(9): if finalMax==ans[i]: print(finalMax) print("%d %d"%(anstmp[i][0],anstmp[i][1] )) break Colored by Color Scripter cs 각 행별로 최댓값.. 2020. 12. 22. [백준] 2547 1 2 3 4 5 6 7 8 9 10 11 import sys t=int(sys.stdin.readline()) for _ in range (t): br=sys.stdin.readline() studentN=int(sys.stdin.readline()) tmp=[] for i in range(studentN): tmp.append(int(sys.stdin.readline())) if sum(tmp)%studentN==0: print("YES") else : print("NO") cs 2020. 12. 22. [백준] 2523 1 2 3 4 5 6 7 8 9 import sys n=int(sys.stdin.readline()) for i in range(n): for j in range(i+1):print("*",end='') print() for i in range(n-1): for j in range(n-i-1):print("*",end='') if i!=n-1: print() cs 2020. 12. 18. [백준] 2522 1 2 3 4 5 6 7 8 9 10 11 12 import sys n=int(sys.stdin.readline()) for i in range(n): for j in range(n-i-1):print(" ",end='') for j in range(i+1):print("*",end='') print() for i in range(n-1): for j in range(i + 1): print(" ", end='') for j in range(n-i-1):print("*",end='') if i!=n-1: print() cs 2020. 12. 18. [백준] 2511 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 import sys a=list(map(int, sys.stdin.readline().split())) b=list(map(int, sys.stdin.readline().split())) ansa=0 ansb=0 acnt=0 bcnt=0 for i in range(10): if a[i]>b[i]:ansa+=3; acnt=i if a[i] ansb: print("%d %d"%(ansa,ansb));print("A") if ansa bcnt: print("%d %d"%(ansa,ansb));print("A") if acnt 2020. 12. 18. [백준] 2506 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 import sys n=int(sys.stdin.readline()) ox=list(map(int, sys.stdin.readline().split())) if ox[0]==0: ans=0;cnt=0 else: ans=1; cnt=1 for i in range(1,n): if ox[i-1]==1: if ox[i]==1: cnt+=1; ans+=cnt else: cnt=0 else : if ox[i]==1: cnt+=1;ans+=1 else: cnt=0 print(ans) Colored by Color Scripter cs 2020. 12. 18. [백준] 2501 1 2 3 4 5 6 mylist=[] a,b= map ( int, input().split()) for i in range(1,a+1): if a%i==0: mylist.append(i) if b>len(mylist): print(0) else : print(mylist[b-1]) cs 2020. 12. 18. [백준] 2476 1 2 3 4 5 6 7 8 9 10 import sys n=int(sys.stdin.readline()) tmp=[] for _ in range(n): a,b,c=map(int,sys.stdin.readline().split()) if a==b==c: tmp.append(10000+a*1000) elif a==b or a==c : tmp.append(1000+100*a) elif b==c: tmp.append(b*100+1000) else : tmp.append(max(a,b,c)*100) print(max(tmp)) Colored by Color Scripter cs 2020. 12. 18. [백준] 2460 1 2 3 4 5 6 7 8 import sys ans=0 tmp=[] for i in range(10): a,b=map(int,sys.stdin.readline().split()) ans=ans-a+b tmp.append(ans) print(max(tmp)) cs 2020. 12. 18. 이전 1 ··· 109 110 111 112 113 114 115 ··· 119 다음
