Use a dictionary to store members of each other. if can not find a pair, print "bad, otherwise print "good". N = int(input()) name1 =...

This is a math question. The original list is from 1 to N. Then remove elements that are multiple cn_i from the list. N = int(input())...

This a math question. Antonia and David are playing a game. Each player starts with 100 points. For each round, who win with n points,...

Easy math question! n = int(input()) ans = 1 while ans*ans <= n: ans += 1 ans -= 1 print("The largest square has side length " +...

https://cemc.uwaterloo.ca/contests/computing/1998/stage1/1998CCCStage1Contest.pdf Change the input string as a list 2. Handle "X"...

https://cemc.uwaterloo.ca/contests/computing/1996/stage1/d-prob.html The problem can be solved in two parts: Rome to digits Digits to...

https://www.cemc.uwaterloo.ca/contests/computing/2011/stage1/juniorEn.pdf Easy problem. antennas = int(input()) eyes = int(input()) if...

The algorithm divides the input list into two parts: a sorted sublist of items which is built up from left to right at the front (left)...

https://www.cemc.uwaterloo.ca/contests/computing/2020/ccc/seniorEF.pdf The problem can be solved only by c++. The key thing is the...

https://www.cemc.uwaterloo.ca/contests/computing/2015/stage%201/juniorEn.pdf Use recursive to solve it: if pieces < people: return 0 if...

https://www.cemc.uwaterloo.ca/contests/computing/2015/stage%201/juniorEn.pdf M = int(input()) f = [0]*101 r = [0]*101 s = [0]*101 time =...

https://www.cemc.uwaterloo.ca/contests/computing/2015/stage%201/juniorEn.pdf This is a string handling question. Build three string based...

This is a Greedy Algorithm. Because if the members of a pair have speeds a and b, then the bike speed of the pair is max(a, b), then...

https://www.cemc.uwaterloo.ca/contests/computing/2016/stage%201/juniorEn.pdf The problem is a math problem. 1. Transfer 7:00 and 10:00...

https://www.cemc.uwaterloo.ca/contests/computing/2017/stage%201/juniorEF.pdf The solution: This is a counting sort problem. we can define...

https://www.cemc.uwaterloo.ca/contests/computing/2017/stage%201/juniorEF.pdf The question asks to compute all arithmetic sequences....

https://www.cemc.uwaterloo.ca/contests/computing/2017/stage%201/juniorEF.pdf The solution: input: x1, y1 # start point coordinate x2, y2...

This is graph question, use DFS to do it. 1. Start from the first page, use DFS to iterative all neighbor pages. Update the minimum...

https://cemc.uwaterloo.ca/contests/computing/2016/stage%201/juniorEn.pdf Using capabilities of substrings put all possible palindromes...

https://www.cemc.uwaterloo.ca/contests/computing/2016/stage%201/seniorEn.pdf Solution 1: recursive that is based on DP solution, please...