摘要: Coprime Arrays "CodeForces 915G " Let's call an array a of size n coprime iff gcd ( a 1, a 2, ..., a n ) = 1, where gcd is the greatest common divisor 阅读全文
posted @ 2019-10-08 22:05 茄子Min 阅读(193) 评论(0) 推荐(0) 编辑
摘要: 牛客练习赛52 | C | "烹饪" | | | | | | | 链接:https://ac.nowcoder.com/acm/contest/1084/C来源:牛客网 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 32768K,其他语言65536K 64bit IO Format 阅读全文
posted @ 2019-10-08 00:23 茄子Min 阅读(320) 评论(0) 推荐(0) 编辑