꾸준히 합시다

https://www.acmicpc.net/problem/13288 13288번: A New Alphabet Input contains one line of text, terminated by a newline. The text may contain any characters in the ASCII range 32–126 (space through tilde), as well as 9 (tab). Only characters listed in the above table (A–Z, a–z) should be translated; any non-alph www.acmicpc.net 문제 유형: 구현, 문자열 # Solution 1 alpha = [' ', 'a', 'b', 'c', 'd', 'e', 'f'..

https://www.acmicpc.net/problem/16337 16337번: Die The boss of Binary Casino wants to have control over games played in his casino. This is especially true in the case of dice games, as from time to time people try to cheat their way to the victory by manipulating dice even after a throw has already occurr www.acmicpc.net 문제 유형: 구현, 문자열 # Solution 1 first = input() second = input() third = input(..

https://www.acmicpc.net/problem/3486 3486번: Adding Reversed Numbers The Antique Comedians of Malidinesia prefer comedies to tragedies. Unfortunately, most of the ancient plays are tragedies. Therefore the dramatic advisor of ACM has decided to transfigure some tragedies into comedies. Obviously, this work is very hard beca www.acmicpc.net 문제 유형: 수학, 구현, 사칙연산 # Solution 1 import sys input = sys.s..

www.acmicpc.net/problem/5533 5533번: 유니크 첫째 줄에 참가자의 수 N이 주어진다. (2 ≤ N ≤ 200) 둘째 줄부터 N개 줄에는 각 플레이어가 1번째, 2번째, 3번째 게임에서 쓴 수가 공백으로 구분되어 주어진다. www.acmicpc.net 문제 유형: 수학, 구현, 사칙연산 # Solution 1 import sys input = sys.stdin.readline N = int(input()) firstgame = [] secondgame = [] thirdgame = [] answer = [0] * N for _ in range(N): first, second, third = map(int, input().split()) firstgame.append(first) s..