![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
CodeForces
剑锋OI
文艺青年还是正高教授,我自己也分不清了呀。
展开
-
Codeforces Round #443 (Div. 1) A. Short Program
时间限制:1S / 空间限制:256MB 【在线测试提交传送门】【问题描述】 Petya learned a new programming language CALPAS. A program in this language always takes one non-negative integer and returns one non-negative integer as wel翻译 2017-11-08 09:39:30 · 249 阅读 · 0 评论 -
Codeforces Round #244 (Div. 2) 427C Checkposts (强连通分量 tarjan模板)
时间限制:2S / 空间限制:256MB 【在线测试提交传送门】【问题描述】 Your city has n junctions. There are m one-way roads between the junctions. As a mayor of the city, you have to ensure the security of all the junctions.To e翻译 2017-11-06 21:00:30 · 709 阅读 · 0 评论 -
Codeforces Round #400 (Div. 1 + Div. 2, combined) 776B Sherlock and his girlfriend
时间限制:1S / 空间限制:256MB 【在线测试提交传送门】【问题描述】 Sherlock has a new girlfriend (so unlike him!). Valentine's day is coming and he wants to gift her some jewelry.He bought n pieces of jewelry. The i-th piece翻译 2017-11-18 15:57:21 · 249 阅读 · 0 评论 -
Codeforces Round #400 (Div. 1 + Div. 2, combined) 776A A Serial Killer
时间限制:1S / 空间限制:256MB 【在线测试提交传送门】【问题描述】 Our beloved detective, Sherlock is currently trying to catch a serial killer who kills a person each day. Using his powers of deduction, he came to know that翻译 2017-11-18 14:27:57 · 248 阅读 · 0 评论 -
Codeforces Round #400 (Div. 1 + Div. 2, combined) 776C Molly's Chemicals
时间限制:1S / 空间限制:256MB 【在线测试提交传送门】【问题描述】 Molly Hooper has n different kinds of chemicals arranged in a line. Each of the chemicals has an affection value, The i-th of them has affection value ai.Mol翻译 2017-11-18 16:35:29 · 209 阅读 · 0 评论 -
Codeforces Round #400 (Div. 1 + Div. 2, combined) 776D. The Door Problem(待翻译)
时间限制:1S / 空间限制:256MB 【在线测试提交传送门】【问题描述】 Moriarty has trapped n people in n distinct rooms in a hotel. Some rooms are locked, others are unlocked. But, there is a condition that the people in the ho翻译 2017-11-19 09:08:51 · 229 阅读 · 0 评论 -
Codeforces Round #400 (Div. 1 + Div. 2, combined) 776E. The Holmes Children(待翻译)
Codeforces Round #241 (Div. 2) 514C Watto and Mechanism ≤,≠,≥<> 时间限制:1S / 空间限制:256MB 【在线测试提交传送门】【问题描述】 The Holmes children are fighting over who amongst them is the cleverest.Mycroft asked Sh翻译 2017-11-19 09:17:40 · 276 阅读 · 0 评论 -
Codeforces Round #400 (Div. 1 + Div. 2, combined) 776F. Sherlock's bet to Moriarty(待翻译)
Codeforces Round #241 (Div. 2) 514C Watto and Mechanism ≤,≠,≥<> 时间限制:1S / 空间限制:256MB 【在线测试提交传送门】【问题描述】 Sherlock met Moriarty for a final battle of wits. He gave him a regular n sided convex p翻译 2017-11-19 09:45:20 · 412 阅读 · 0 评论