思考题 from Maths homework again...

Why 60.5? Not because it has sth to do with the previous problem, which happens to also be a math problem. It's because the next OBCYSIO was also named as Ep.61 and the problem was discovered 1 year later!!

数学小题两道

Problem A

You are given a bipartite graph G, find a proper coloring of the complement of G that uses minimum colors.

|G|\leq 100

Problem B

Given integer N. Find any n\geq N such that n+\varphi(n) is a perfect square, where \varphi(n) is the Euler Totient Function.

N\leq 10^9

Brute force might work well under this limit 😛