꾸준히 합시다

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..

https://www.acmicpc.net/problem/4714 4714번: Lunacy After several months struggling with a diet, Jack has become obsessed with the idea of weighing less. In an odd way, he finds it very comforting to think that, if he had simply had the luck to be born on a different planet, his weight could be considerably www.acmicpc.net 문제 유형: 수학, 사칙연산 # Solution 1 while True: weight = float(input()) if weight..

www.acmicpc.net/problem/9094 9094번: 수학적 호기심 첫째 줄에 테스트 케이스의 개수 T가 주어진다. 각 테스트 케이스는 한 줄로 이루어져 있으며, n과 m이 주어진다. 두 수는 0보다 크고, 100보다 작거나 같다. www.acmicpc.net 문제 유형: 수학, 브루트포스 알고리즘 # Solution 1 import sys input = sys.stdin.readline for _ in range(int(input())): n, m = map(int, input().split()) count = 0 for a in range(1, n - 1): for b in range(a + 1, n): if (a**2 + b**2 + m) % (a*b) == 0: count += 1 pr..