source Code

Programmers | week3 문제 풀이

Programmers 문제 풀이 12916 # 문자열내p와y의개수 def solution(s): count_x = 0 count_y = 0 for i in s: if (i == 'p') or (i == 'P'): count_x += 1 elif (i == 'y') or (i == 'Y'): count_y += 1 if count_x == count_y: answer = True elif count_x != count_y: answer = False return answer 12948 # 핸드폰 번호 가리기 def solution(phone_number): answer = '' answer = phone_number.replace(phone_number[:-4], '*'*len(phone_number[:-..

Programmers | week2 문제 풀이

Programmers 문제 풀이 1. 두 정수 사이의 합 def solution(a, b): answer = 0 if a < b: for num in range(a, b+1): answer += num elif a == b: answer += a else: for num in range(b, a+1): answer += num return answer 2. 문자열을 정수로 바꾸기 def solution(s): s = int(s) return s 3. 정수 내림차순으로 배치하기 def solution(n): n = str(n) n = sorted(n, reverse=True) # reverse와 reversed의 차이? answer = "".join(n) answer = int(answer) return ..

Programmers | week1 문제 풀이

Programmers 문제 풀이 1. 평균 구하기 def solution(arr): allsum = sum(arr) count = len(arr) answer = allsum / count return answer 2. 짝수와 홀수 def solution(num): if num % 2 == 0: answer = 'Even' else: answer = 'Odd' return answer 3. 자릿수 더하기 def solution(n): answer = 0 n = str(n) for i in n: i = int(i) answer += i return answer 4. 자연수 뒤집어 배열로 만들기 def solution(n): n = str(n) answer = [] for i in n[::-1]: i = i..

BAE/<JOON> | 1차원 배열

1. [avg_program_1546.py] tc = int(input()) score = list(map(int,input().split())) score.sort() max_score = score[-1] sum = 0 for s in score : s = s/max_score*100 sum = sum + s print(sum / tc) 2. [max_arr_2562.py] num_list = [] for i in range(9): num = int(input()) num_list.append(num) small = 0 for n in num_list: if small < n: small = n print(small) print(num_list.index(small) + 1) 3. [OX_sum_89..

BAE/<JOON> | 반복문

1. [case_sum_11021.py] tc = int(input()) sum = 0 for case in range(1, tc+1) : a, b = map(int, input().split()) sum = a+b print(f'Case #{case}: {sum}') print('Case #%d: %d' %(case,sum)) 2. [list_10871.py] : tc가 주어지면 tc만큼 list를 입력 해야되는데 적든/많든 상관없이 실행됨 (인터넷도 동일하게 설명되어 있음) tc, num = map(int,input().split()) list_num = list(map(int,input().split())) # list_num = [] small_num = [] # for case in range ..

BAE/<JOON> | 조건문

1. [alarm_2844] # 2884 hour, minute = map(int, input().split()) alarm_h = 0 alarm_m = 0 if hour == 0 : if minute >= 45: alarm_m = minute - 45 print(hour, alarm_m) else: alarm_m = 60 - (45-minute) alarm_h = 23 print(alarm_h, alarm_m) else: if minute >= 45: alarm_m = minute - 45 print(hour, alarm_m) else: alarm_m = 60 - (45-minute) alarm_h = hour - 1 print(alarm_h, alarm_m) 2. [oven_alarm_2525] # ..