2024年3月8日
A. k-th divisor
摘要： https://codeforces.com/problemset/problem/762/A This is a easy problem based on number theory. We just simply iterate i from 1 to the value of sqrt(n) 阅读全文
posted @ 2024-03-08 21:55 _Yxc 阅读(19) 评论(0) 推荐(0)