Orange Boy Can You Solve It Out? Ep. 61

思考题 from Maths homework again...

数学小题两道

Problem A

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

G100|G|\leq 100

Problem B

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

N109N\leq 10^9

Brute force might work well under this limit 😛

版权声明:
作者:XGN
链接:https://blog.hellholestudios.top/archives/1399
来源:Hell Hole Studios Blog
文章版权归作者所有,未经允许请勿转载。

THE END
分享
二维码
< <上一篇
下一篇>>
文章目录

Problem A

Problem B

关闭
目 录