Chen.Jr的博客

传送门 题面：   E. Reachability from the Capital time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output There are nn cities and mm roads in...

传送门 题面： D. Mouse Hunt time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Medicine faculty of Berland State University has just fin...

传送门 题面： One day in the jail, F·F invites Jolyne Kujo (JOJO in brief) to play tennis with her. However, Pucci the father somehow knows it and wants to stop her. There are NN spots in the jail and MM ...

传送门 题意： 现在有两种操作： 更改名字iniiniini 输入一个名字namenamename，如果namenamename和iniiniini相同，则名字为namenamename的朋友会开心（否则不开心） 现在有nnn次这两种操作，问你最多能够使得多少个朋友开心。 题目分析： 首先我们考虑每一个1…2 2 2…11\dots 2~2~2\dots 11…2&nbsp...