본문 바로가기

Programming [Python]

 (411)
#248 백준 파이썬 [2563] 색종이 https://www.acmicpc.net/problem/2563 Python Code N = int(input()) paper = [[0 for _ in range(101)] for _ in range(101)] for _ in range(N): x, y = map(int, input().split()) for i in range(x, x+10): for j in range(y, y+10): paper[i][j] = 1 answer = 0 for row in paper: answer += row.count(1) print(answer)
#247 백준 파이썬 [10990] 별 찍기 - 15 https://www.acmicpc.net/problem/10990 Python Code N = int(input()) for i in range(1, N+1): if i == 1: print(' '* (N-i),'*',sep = '') elif i == N: print('*',' '*(2*i-3),'*',sep = '') else: print(' '* (N-i),'*',' '*(2*i-3),'*', sep = '')
#246 백준 파이썬 [6359] 만취한 상범 https://www.acmicpc.net/problem/6359 Python Code T = int(input()) for _ in range(T): n = int(input()) answer = 0 for i in range(1, n): if i**2 n: break print(answer)
#245 백준 파이썬 [9507] Generations of Tribbles https://www.acmicpc.net/problem/9507 Python Code def koong(n): if n < 2: print(1) elif n == 2: print(2) elif n == 3: print(4) else: t1 = t2 = 1 t3 = 2 t4 = 4 for _ in range(n-3): t5 = t1 + t2 + t3 + t4 t1 = t2 t2 = t3 t3 = t4 t4 = t5 print(t5) t = int(input()) for _ in range(t): n = int(input()) koong(n)
#244 백준 파이썬 [16673] 고려대학교에는 공식 와인이 있다 https://www.acmicpc.net/problem/16673 Python Code C,K,P = map(int, input().split()) answer = 0 for i in range(1, C + 1): answer += K*i + P*(i**2) print(answer)
#243 백준 파이썬 [11655] ROT13 https://www.acmicpc.net/problem/11655 Python Code S = str(input()) alphabet = 'abcdefghijklmnopqrstuvwxyz' ALPHABET = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' answer = '' for s in S: if s == ' ': answer += ' ' continue try: answer += str(int(s)) except: if s in alphabet: i = alphabet.index(s) if i > 12: answer += alphabet[i-13] else: answer += alphabet[i+13] else: i = ALPHABET.index(s) if i > 12: answer += ..
#242 백준 파이썬 [10992] 별 찍기 - 17 https://www.acmicpc.net/problem/10992 Python Code N = int(input()) for i in range(1, N+1): if i == N: print('*'*(2*i-1)) elif i == 1: print(' '* (N-i),'*',sep = '') else: print(' '* (N-i),'*',' '*(2*i-3),'*', sep = '')
#241 백준 파이썬 [17390] 이건 꼭 풀어야 해! https://www.acmicpc.net/problem/17390 Python Code 연속된 합을 구해놓고 빼주면 된다. import sys N, Q = map(int, sys.stdin.readline().split()) A = list(map(int, sys.stdin.readline().split())) A = sorted(A) for i in range(1, len(A)): A[i] = A[i] + A[i-1] for _ in range(Q): L, R = map(int, sys.stdin.readline().split()) if L == 1: print(A[R-1]) else: print(A[R-1] - A[L-2])

티스토리툴바