
ACM_CodeForces
文章平均质量分 85
angle555945
这个作者很懒,什么都没留下…
展开
-
Codeforces Round #143 (Div. 2) B - Magic, Wizardry and Wonders 数学
Vasya the Great Magician and Conjurer loves all kinds of miracles and wizardry. In one wave of a magic wand he can turn an object into something else. But, as you all know, there is no better magic in原创 2012-10-08 12:06:34 · 1495 阅读 · 0 评论 -
Codeforces Round #141 (Div. 2) B. Two Tables 枚举
You've got two rectangular tables with sizes na × ma and nb × mb cells. The tables consist of zeroes and ones. We will consider the rows and columns of both tables indexed starting from 1. Then we w原创 2012-10-08 11:48:46 · 1649 阅读 · 0 评论 -
Codeforces Round #143 (Div. 2) C. To Add or Not to Add 胡搞
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.However, before looking for such number, you原创 2012-10-09 12:09:48 · 1167 阅读 · 0 评论