Vanilla Yukirin永远可爱 永远善良
MODE
主页 首页 标签69 分类3 归档60 关于 友链 工具 搜索
已记录 60 篇文章 3 个分类 · 69 个标签
Vanilla 的头像
Vanilla 但Vanilla会努力的
GitHub E-Mail cnblog Codeforces
MODE
永远可爱 永远善良
Vanilla Yukirin

#GCD|LCM

1 entries
01

CF1152C Neko does Maths

ProblemNeko has two integers and . His goal is to find a non-negative integer such that the least common multiple of and is the smallest possible. If there are multiple optimal integers , he needs to choose the smallest one. Given his mathematical talent, Neko had no trouble getting Wrong Answer on this problem. Can you help him solve it? 找 使 ,若有多个 ,取最小的。

2024—07—22515 / ≈ 2 MIN
赣ICP备2024036347号-1 · 赣公网安备36010802001026号 · 萌ICP备20245311号 由 Hexo & Shikishi 驱动
构建于 UTC+8 2026.11.17 22:25:29
⌕
    输入关键词开始搜索(Esc 关闭)