![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
codeforces
文章平均质量分 56
Niiiii..
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #298 (Div. 2), problem: (A) Exam
Codeforces Round #298 (Div. 2), problem: (A) ExamAn exam for n students will take place in a long and narrow room, so the students will sit in a line in some order. The teacher suspects that students with adjacent numbers (i and i + 1) always studied side原创 2015-05-26 22:59:16 · 537 阅读 · 0 评论 -
contest: Codeforces Round #307 (Div. 2), problem: (A) GukiZ and Contest
A. GukiZ and Contesttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputProfessor GukiZ likes programming cont原创 2015-06-15 09:34:11 · 897 阅读 · 0 评论 -
contest: Codeforces Round #300, problem: (A) Cutting Banner(解法 1、2)
contest: Codeforces Round #300, problem: (A) Cutting BannerA large banner with word CODEFORCES was ordered for the 1000-th onsite round of Codeforcesω that takes place on the Miami beach. Unfortunately, the company that made the banner mixed up two orders原创 2015-05-23 04:09:24 · 770 阅读 · 0 评论 -
contest: Codeforces Round #300, problem: (B) Quasi Binary
contest: Codeforces Round #300, problem: (B) Quasi Binary原创 2015-05-23 05:59:04 · 971 阅读 · 0 评论 -
contest: Codeforces Round #297 (Div. 2), problem: (B) Pasha and String
转置与顺序无关,比如 1 2 3 4 5 和 5 4 3 2 1的转置顺序结果是一样的,所以先进行排序,删除成对的且相同的,同一部分转置两次相当于没转;即 1-10,3-8,4-7,5-6 先看前两个 3-8转了两次 所以只需要转置 1,2,与9,10即可 同理 只要交换4与7即可。于是要进一步优化,例如一个长度为10的串,输入 5 4 3 2 2 1 先排序,删掉两个2,剩下 1 3 4 5。其实还可以简化,刚开始嫌麻烦就这样交了..于是超时了..刚好卡在最后一组数据上..原创 2015-05-24 00:22:31 · 679 阅读 · 0 评论 -
contest: Codeforces Round #300, problem: (A) Cutting Banner(解法 3)
contest: Codeforces Round #300, problem: (A) Cutting BannerA large banner with word CODEFORCES was ordered for the 1000-th onsite round of Codeforcesω that takes place on the Miami beach. Unfortunately, the company that made the banner mixed up two orders原创 2015-05-23 04:43:06 · 952 阅读 · 0 评论 -
contest: Codeforces Round #303 (Div. 2), problem: (A) Toy Cars
contest: Codeforces Round #303 (Div. 2), problem: (A) Toy CarsThere are n toy cars. Each pair collides. The result of a collision can be one of the following: no car turned over, one car turned over, both cars turned over. A car is good if it turned over原创 2015-05-22 16:00:30 · 726 阅读 · 0 评论 -
Codeforces Round #295 (Div. 2), problem: (A) Pangram
Codeforces Round #295 (Div. 2), problem: (A) PangramYou are given a string consisting of lowercase and uppercase Latin letters. Check whether this string is a pangram. We say that the string contains a letter of the Latin alphabet if this letter occurs in原创 2015-05-22 14:54:58 · 563 阅读 · 0 评论 -
codeforces 545B Equidistant String
codeforces 545B Equidistant StringWe will define the distance between two strings s and t of the same length consisting of digits zero and one as the number of positions i, such that si isn't equal to ti.原创 2015-05-22 13:40:12 · 698 阅读 · 0 评论 -
contest: Codeforces Round #301 (Div. 2), problem: (A) Combination Lock
contest: Codeforces Round #301 (Div. 2), problem: (A) Combination LockThe combination lock is represented by n rotating disks with digits from 0 to 9 written on them. Scrooge McDuck has to turn some disks so that the combination of digits on the disks for原创 2015-05-22 14:22:25 · 435 阅读 · 0 评论 -
Codeforces Round #305 (Div. 2), problem: (A) Mike and Fax
Codeforces Round #305 (Div. 2), problem: (A) Mike and Fax原创 2015-05-28 20:30:34 · 761 阅读 · 0 评论 -
Codeforces Round #306 (Div. 2), problem: (A) Two Substrings
A. Two Substringstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given strings. Your task is to d原创 2015-06-16 03:04:41 · 1104 阅读 · 0 评论