为什么说 "orzdevinwang will reach 4000 in 1 year."（详细揭秘）

· · 个人记录

orzdevinwang will reach 4000 in 1 year 是怎么回事呢？那么 orzdevinwang 为什么会 will reach 4000 in 1 year，相信大家都很好奇。大家可能会感到很惊讶，orzdevinwang 为什么会 will reach 4000 in 1 year 呢？但事实就是这样，小编也感到非常惊讶。

在信息学论坛 Codeforces 上，我们找到一名作者为 "Indonesialbedo's blog" 的同学对他的一些介绍，其中写道：

As we have witnessed, in the recently concluded CodeTON Round 6, \tt{\color{black}o}{\color{red}{rzdevinwang}} achieved the 1st place.

In fact it was the second time that he got rank#1 in Div.1+2: rank#1 in the Codeforces Round 844.

This is only what he has achieved on Codeforces; when we examine his achievements in other areas, we can still be surprised.

For example, on the AtCoder, he has been rank#1 in AGC for 3 times yet.

And the 4th place in AGC061; and rank 1/2 in ARC for countless times.

He has been the youngest LGM in the history of Codeforces so far. (I means the age when he reached LGM. Sorry for the confusion it has made.)

In the ZJOI 2022, he reached rank 1 in Zhejiang, one of the best provinces on CP in China.

In the CNOI 2023, he got 669pts in the 1st place, while the one in the 2nd place got only 614pts(55pts less than him!), which is amazing.

In the near future, he'll definitely represent China in participating in the IOI.

From ISIJ to APIO, from Codefoces to AtCoder, from ZJOI to CNOI, \tt{\color{black}o}{\color{red}{rzdevinwang}} has become a dazzling star, inspiring us to continue moving forward.

In my opinion, he's the one who has the greatest possiblity to reach 4000 firstly in the world, and surely will achieve it in 1 year.

原来，orzdevinwang 是著名金牌选手周康阳同学在 Codeforces 平台上的用户名。那么说他在 Codeforces 上能在一年内达到 4000 分这件事，我们也就毫不意外了。

这就是关于 orzdevinwang will reach 4000 in 1 year 的事情了，大家有没有觉得很神奇呢？快来在评论区与小编互动吧！

参考资料：