数学:计数
文章平均质量分 82
Killerfear
这个作者很懒,什么都没留下…
展开
-
UVA 11133 - Eigensequence
Problem E: Eigensequence Given an increasing sequence of integers a1, a2, a3, ..., ak, the E-transform produces a sequence of the same length, b1, b2, b3, ..., bk such that b1 = a1for j>1, bj原创 2015-01-09 16:29:37 · 458 阅读 · 0 评论 -
UVA 12034 Race
Race Disky and Sooma, two of the biggest mega minds of Bangladesh went to a far country. They ate, coded and wandered around, even in their holidays. They passed several months in this way原创 2014-12-28 13:10:12 · 474 阅读 · 0 评论 -
UVA 10593 - Kites
Problem E Kites Time Limit 4 Seconds The season of flying kites is well ahead. So what? Let us make an inventory for kites. We are given a square shaped sheet of paper.原创 2014-12-28 19:48:42 · 468 阅读 · 0 评论 -
UVA 10844 - Bloques bell数
Problem E Bloques Time Limit: 2 seconds Little Joan has N blocks,all of them of different sizes. He is playing to build cities in the beach. A city is just a collection of buildings. A single原创 2014-12-28 22:55:19 · 499 阅读 · 0 评论 -
10574 - Counting Rectangles
Problem H Counting Rectangles Input: Standard Input Output: Standard Output Time Limit: 3 Seconds Given n points on the XY plane, count how many regular rectangles are formed. A rectangle is r原创 2014-12-28 14:36:40 · 574 阅读 · 0 评论 -
UVA 10843 - Anne's game
Problem D Anne's game Time Limit: 2 seconds Lily: "Chantarelle was part of my exotic phase." Buffy: "It's nice. It's a mushroom." Lily: "It is? That's really embarrassing." Buffy: "Wel原创 2014-12-28 20:00:49 · 749 阅读 · 0 评论 -
UVA 10581 Partitioning for fun and profit
Problem A: Partitioning for fun and profit A partition of a positive integer number m into nelements (n ≤ m) is a sequence of positive numbersa1,...,an such that a1+...+an = m anda1 ≤ a2 ≤ ...原创 2014-12-28 15:33:18 · 422 阅读 · 0 评论 -
UVA 10712 - Count the Numbers 容斥
Problem H Count the Numbers Input: standard input Output: standard output Time Limit: 2 seconds You're given three non-negative integers N (0 , A, B, (0 . Count the number of integers in the i原创 2014-12-26 17:47:19 · 516 阅读 · 0 评论 -
UVA 10623 Thinking Backward 欧拉公式
Problem A Thinking Backward Input: Standard Input Output: Standard Output Time Limit: 2 Seconds Plane division by a common shape is a very well known topic of computer science. The pictures b原创 2014-12-25 23:57:59 · 519 阅读 · 0 评论 -
UVA 10458 Cricket Ranking (容斥)
Problem F Cricket Ranking Input: standard input Output: standard output Time Limit: 2 seconds World Cup Cricket 2003 is now going on in South Africa. The final will be held on 23rd March in Jo原创 2014-12-24 21:16:08 · 466 阅读 · 0 评论 -
UVA 10237 Bishops
Problem B Bishops Input: standard input Output: standard output Time Limit: 4 seconds Memory Limit: 32 MB A bishop is a piece used in the game of chess which is played on a board of squar原创 2014-12-22 23:47:35 · 606 阅读 · 0 评论 -
UVA 11481 Arrange the Numbers (容斥)
思路:我们能用容斥来做的...代码很短,具体可以看代码。 代码: #include #include #include #include #include #include #include #include #define rep(i,a,b) for(int i=(a);i<(b);++i) #define rrep(i,b,a) for(int i = (b);原创 2014-12-22 18:14:13 · 381 阅读 · 0 评论 -
UVA 1436 Counting heaps (树形dp)
We are given a rooted tree of n vertices. The vertices are to be labeled with numbers 1, 2,..., n so that each label is unique and the heap condition holds, i.e. the label of any vertex is less than原创 2014-12-22 17:32:28 · 649 阅读 · 0 评论 -
UVA 12123 Magnetic Train Tracks
The rail roads of Japan are being redesigned. So the governent is planning to install ultra-modern Magnetic trains instead of the current normal trains. As fuel price have gone high and nations have s原创 2014-12-22 02:11:13 · 568 阅读 · 0 评论 -
UVA 11529 Strange Tax Calculation
思路:我们算每个点在多少个三角形内就行了.....我们枚举每个点为原点,然后统计有多少个三角形包含这个原点。统计的话,我们按照极角排序,当确定了两个点的时候,可以马上知道第三个点的区间,画个图就知道了.....当然直接这样枚举两个点的话单个点的复杂度就是n^2,这样显然不行嘛。。。其实这里我们可以降低一维的....用前缀和之类的搞搞它就行了。 代码: #include #includ原创 2014-12-21 23:10:07 · 392 阅读 · 0 评论 -
UVA 1393 - Highways
Hackerland is a happy democratic country with m×n cities, arranged in a rectangular m by n grid and connected by m roads in the east-west direction and n roads in the north-south direction. By publi原创 2014-12-21 16:28:43 · 407 阅读 · 0 评论 -
UVA 12075 Counting Triangles
Triangles are polygons with three sides and strictly positive area. Lattice triangles are the triangles all whose vertexes have integer coordinates. In this problem you have to find the number of latt原创 2014-12-21 21:40:37 · 473 阅读 · 0 评论 -
UVA 766 Sum of powers
Sum of powers A young schoolboy would like to calculate the sum for some fixed natural k and different natural n. He observed that calculating ik for all i ( ) and summing原创 2014-12-29 00:50:18 · 571 阅读 · 0 评论