python-algorithm1402 [백준] 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. [백준] 2455 1 2 3 4 5 6 7 8 import sys ans=0 tmp=[] for i in range(4): a,b=map(int,sys.stdin.readline().split()) ans=ans-a+b tmp.append(ans) print(max(tmp)) cs 2020. 12. 18. [백준] 2446 1 2 3 4 5 6 7 8 9 10 import sys n=int(sys.stdin.readline()) for i in range(n): for j in range(i): print(" ",end='') for j in range(2*(n-i)-1): print("*",end='') print("") for i in range(1,n): for j in range(n-i-1): print(" ",end='') for j in range(2*(i+1)-1): print("*",end='') if i!=n-1:print("") cs 2020. 12. 18. [백준] 2445 1 2 3 4 5 6 7 8 9 10 11 12 import sys n=int(sys.stdin.readline()) for i in range(1,n+1): for j in range(i): print("*",end='') for j in range(2*(n-i)): print(" ",end='') for j in range(i): print("*", end='') print("") for i in range(n-1): for j in range(n-i-1): print("*",end='') for j in range(2*(i+1)): print(" ",end='') for j in range(n - i - 1): print("*", end='') if i!=n-2:print("") cs 2020. 12. 18. [백준] 2444 1 2 3 4 5 6 7 8 9 10 import sys n=int(sys.stdin.readline()) for i in range(n-1): for j in range(n-i-1): print(" ",end='') for j in range(2*i+1): print("*",end='') print("") for i in range(n): for j in range(i): print(" ",end='') for j in range(2*(n-i-1)+1): print("*",end='') print("") Colored by Color Scripter cs 2020. 12. 18. [백준] 2443 1 2 3 4 5 6 import sys n=int(sys.stdin.readline()) for i in range(n): for j in range(i): print(" ",end='') for j in range(2*(n-i-1)+1): print("*",end='') print("") Colored by Color Scripter cs 2020. 12. 18. [백준] 2442 1 2 3 4 5 6 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(2*i+1): print("*",end='') print("") Colored by Color Scripter cs 개인적으로 이런 류의 문제를 썩 좋아하는 편은 아니지만 별찍기 시리즈를 풀면 반복문과 출력에 대한 개념이 잘 잡히는것 같습니다.! 2020. 12. 18. [백준] 2355 1 2 3 import sys a,b=map(int, input().split()) print(int ((a+b)*(abs(a-b)+1)/2)) cs 2020. 12. 18. [백준] 2061 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 import sys import math def checkPrime(n): sieve=[True]*n a=int(math.sqrt(n)) for i in range(2,a+1): if sieve[i]: for j in range(i+i,n,i): sieve[j]=False return [i for i in range(2,n) if sieve[i]==True] p,k=map(int, sys.stdin.readline().split()) ans=0 tmp=checkPrime(k) for i in range (len(tmp)): if p%tmp[i]==0: print("BAD %d"%tmp[i]) exit() if ans==.. 2020. 12. 18. 이전 1 ··· 108 109 110 111 112 113 114 ··· 117 다음
