- 博客(10)
- 收藏
- 关注
原创 ZOJ3279Ants(树状数组前缀和)
echo is a curious and clever girl, and she is addicted to the ants recently.She knows that the ants are divided into many levels depends on ability, also, she finds the number of each level will cha
2013-11-30 21:51:46 942
原创 Uva10288Coupons
CouponsInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MB Coupons in cereal boxes are numbered 1 to n, and a set of one of each is required for a prize (a
2013-11-29 19:04:44 1054
原创 东华大学教务处python爬虫
'''Created on 2013-11-12@author: mowayao'''import urllib import urllib2import cookielibimport redef SubTitle(web): key = ".+" title = re.findall(key,web) return titlecookie = c
2013-11-13 22:16:33 3163
原创 Ural1039. Anniversary Party
BackgroundThe president of the Ural State University is going to make an 80'th Anniversary party. The university has a hierarchical structure of employees; that is, the supervisor relation forms a
2013-11-11 23:38:05 1295
原创 URAL1036Lucky Tickets(DP+高精度)
You are given a number 1 ≤ N ≤ 50. Every ticket has its 2N-digit number. We call a ticket lucky, if the sum of its first N digits is equal to the sum of its last N digits. You are also given the sum
2013-11-11 13:20:13 689
转载 矩阵 快速幂
出处http://www.cnblogs.com/yan-boy/archive/2012/11/29/2795294.html矩阵的快速幂是用来高效地计算矩阵的高次方的。将朴素的o(n)的时间复杂度,降到log(n)。这里先对原理(主要运用了矩阵乘法的结合律)做下简单形象的介绍:一般一个矩阵的n次方,我们会通过连乘n-1次来得到它的n次幂。但做下简单的改进就能
2013-11-10 11:24:55 559
原创 ZOJ3216Compositions
We consider problems concerning the number of ways in which a number can be written as a sum. If the order of the terms in the sum is taken into account the sum is called a composition and the numbe
2013-11-10 10:47:53 753
原创 URAL1019. Line Painting
The segment of numerical axis from 0 to 109 is painted into white color. After that some parts of this segment are painted into black, then some into white again and so on. In total there have been
2013-11-08 20:05:21 948
原创 URAL1018. Binary Apple Tree
Let's imagine how apple tree looks in binary computer world. You're right, it looks just like a binary tree, i.e. any biparous branch splits up to exactly two new branches. We will enumerate by intege
2013-11-08 18:26:21 781
原创 SGU497Abelian Groups
Andrew has just made a breakthrough in group theory: he realized that he can classify all finite Abelian groups (not much of a breakthrough, indeed). Given n, how many Abelian groups with n elements
2013-11-07 21:18:28 605
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人