摘要: link:https://codeforces.com/contest/1423/problem/K 题意:对两个不同正整数 \(a,b\) ,称他们是朋友,当且仅当 \(\gcd(a,b),\frac{a}{\gcd(a,b)},\frac{b}{\gcd(a,b)}\) 作为边长可以构成三角形。 阅读全文
posted @ 2024-05-11 00:57 yoshinow2001 阅读(20) 评论(0) 推荐(0) 编辑
摘要: link:https://codeforces.com/contest/1423/problem/J Given a number \(m\), how many polynomials \(P\) with coefficients in set \({\{0,1,2,3,4,5,6,7\}}\) 阅读全文
posted @ 2024-05-11 00:43 yoshinow2001 阅读(6) 评论(0) 推荐(0) 编辑