NIO‘s Sword题解报告

最新推荐文章于 2024-06-15 23:36:03 发布

长安望君君不归

最新推荐文章于 2024-06-15 23:36:03 发布

阅读量80

点赞数 1

文章标签：算法 c++

本文链接：https://blog.csdn.net/xclzls/article/details/126455351

版权

链接：https://ac.nowcoder.com/acm/contest/33189/K
来源：牛客网
题目描述
See Problem N for PDF statements.
NIO is playing a new game. In this game, NIO has a sword with attack power represented by an integer $A$ . Initially, $A = 0$ . There are also nn enemies in the game. NIO has to kill them in order, which means NIO must kill the $(i - 1) - t h$ enemy before killing the $i - t h$ enemy for each $(2\le i\le n)$ . For the ii-th enemy, NIO can kill it if and only if
$A\equiv i \pmod{n}$ .

Fortunately, NIO can upgrade his sword at any moment for any number of times. Each time NIO upgrades his sword, he first chooses an integer

最低0.47元/天解锁文章

确定要放弃本次机会？

福利倒计时

: :

立减 ¥

普通VIP年卡可用

立即使用

长安望君君不归

关注关注

1
点赞
踩
1

收藏

觉得还不错? 一键收藏
0
评论
NIO‘s Sword题解报告

NIO is playing a new game. In this game, NIO has a sword with attack power represented by an integer $A$. Initially, $A=0$. There are also nn enemies in the game. NIO has to kill them in order, which means NIO must kill the $(i−1)-th$ enemy before killing
复制链接

扫一扫