upsolved by
solved by 2sozx
签到题
签到题
upsolved by
solved by 2sozx Bazoka13 JJLeo
长度为 $1\sim n$ 的棍子各一个,问最少拿走几个使得剩下的棍子构不成三角形。 $n\le 20$
upsolved by
solved by
solved by
solved by
solved by
solved by
upsolved by
before:CSK查询比赛找到这场比赛,MJX找个空教室并多次眼神暗示教室另外一人将其劝退
0min:开局分题,MJX冲B
3min:AC,CSK冲F
26min:CSK WA1后AC,ZYF冲I
44min:ZYF TLE,一起讨论D发现可以打表,MJX打表
64min:MJX AC,CSK冲H,ZYF继续冲I
90min:CSK RE1后AC,ZYF冲J
187min:ZYF WA1RE1后AC,看G发现结论ZYF冲G
206min:ZYF AC,冲E,MJX看I
260min:MJX发现主席树多写了一个log,改后AC,一起冲E
300min:CSK发现少讨论一种情况,gg
after end:E加上这种情况就过了,期间讨论K应该是正解但是没时间写了
比赛中:教室蚊子太多了,ZYF被叮肿了一圈