![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
推理结论
Effervescence
OIer
展开
-
Codeforces Round #439 (Div. 2) A. The Artful Expedient
A. The Artful ExpedientProblem StatementRock... Paper!After Karen have found the deterministic winning (losing?) strategy for rock-paper-scissors, her brother, Koyomi, comes up with a new game as a substit原创 2017-10-07 14:39:22 · 572 阅读 · 0 评论 -
Codeforces Round #444 (Div. 2) A. Div. 64
A. Div. 64Problem Statement Top-model Izabella participates in the competition. She wants to impress judges and show her mathematical skills. Her problem is following: for given string, co原创 2017-11-05 14:39:54 · 342 阅读 · 0 评论 -
Codeforces Round #443 (Div. 2) E. Tournament
E. TournamentProblem Statement Recently a tournament in k kinds of sports has begun in Berland. Vasya wants to make money on the bets. The scheme of the tournament is very mysteriou原创 2017-11-01 16:14:48 · 514 阅读 · 0 评论 -
Codeforces Round #401 (Div. 2) A. Shell Game
A. Shell GameProblem Statement Bomboslav likes to look out of the window in his room and watch lads outside playing famous shell game. The game is played by two persons: operator and player. Oper原创 2017-10-13 18:27:32 · 253 阅读 · 0 评论 -
Codeforces Round #443 (Div. 2) C. Short Program
C. Short ProgramProblem Statement 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 well.原创 2017-10-28 18:21:28 · 277 阅读 · 0 评论 -
Codeforces Round #443 (Div. 2) B. Table Tennis
B. Table TennisProblem Statement n people are standing in a line to play table tennis. At first, the first two players in the line play a game. Then the loser goes to the end of the line, an原创 2017-10-27 16:41:29 · 322 阅读 · 0 评论 -
Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) D. Sorting the Coins
D. Sorting the CoinsProblem Statement原创 2017-10-19 17:51:48 · 281 阅读 · 0 评论 -
Codeforces Round #438 (Div. 1 + Div. 2 combined) D. Huge Strings
D. Huge StringsProblem Statement You are given n strings s1s_1, s2s_2, …, sns_n consisting of characters 0 and 1. m operations are performed, on each of them you concatenate two existing strings原创 2017-10-06 13:24:42 · 240 阅读 · 0 评论 -
Codeforces Round #438 (Div. 1 + Div. 2 combined) C. Qualification Rounds
C. Qualification RoundsProblem Statement Snark and Philip are preparing the problemset for the upcoming pre-qualification round for semi-quarter-finals. They have a bank of n problems, and they w原创 2017-10-06 12:57:42 · 236 阅读 · 0 评论 -
Codeforces Round #441 (Div. 2, by Moscow Team Olympiad) A. Trip For Meal
A. Trip For MealProblem Statement Winnie-the-Pooh likes honey very much! That is why he decided to visit his friends. Winnie has got three best friends: Rabbit, Owl and Eeyore, each of them lives原创 2017-10-18 19:12:58 · 439 阅读 · 0 评论 -
Codeforces Round #440 (Div. 2) C. Maximum splitting
C. Maximum splittingProblem Statement You are given several queries. In the i-th query you are given a single positive integer nin_i. You are to represent nin_i as a sum of maximum possible numbe原创 2017-10-18 18:39:58 · 253 阅读 · 0 评论 -
Codeforces Round #440 (Div. 2) B. Maximum of Maximums of Minimums
B. Maximum of Maximums of MinimumsProblem Statement You are given an array a1a_1, a2a_2, …, ana_n consisting of n integers, and an integer k. You have to split the array into exactly k non-empty原创 2017-10-18 18:21:32 · 253 阅读 · 0 评论 -
Codeforces Round #439 (Div. 2) C. The Intriguing Obsession
C. The Intriguing ObsessionProblem Statement — This is not playing but duty as allies of justice, Nii-chan! — Not allies but justice itself, Onii-chan! With hands joined, go everywh原创 2017-10-07 15:05:11 · 550 阅读 · 0 评论 -
Codeforces Round #439 (Div. 2) B. The Eternal Immortality
B. The Eternal ImmortalityProblem Statement Even if the world is full of counterfeits, I still regard it as wonderful. Pile up herbs and incense, and arise again from the flames and ashes原创 2017-10-07 14:54:03 · 457 阅读 · 0 评论 -
AIM Tech Round 5 (rated, Div. 1 + Div. 2)F. Make Symmetrical(结论+暴力)
题意 给一个无限大的二维平面,n(n≤2∗105)n(n≤2∗105)n(n\leq 2*10^5)次操作,(1)在平面上加一个点(保证加入前不存在),(2)在平面上删除一个点(保证删除时存在),(3)给出一个点,以原点和这个点连成的直线为对称轴,问你至少要加几个点可以使得这个平面对称。分析 首先我们猜一个结论,就是一个以原点为圆心的圆上的整点是不会很多的(具体我...原创 2018-08-28 09:29:38 · 654 阅读 · 2 评论