数学问题
冬天的一缕阳光
这个作者很懒,什么都没留下…
展开
-
Rancher's Gift
DescriptionRancher Joel has a tract of land in the shape of a convex quadrilateral that he wants to divide among his sons Al, Bob, Chas and Dave, who wish to continue ranching on their portion原创 2013-07-25 10:47:07 · 810 阅读 · 0 评论 -
zoj 3806 Incircle and Circumcircle
Incircle and CircumcircleTime Limit: 2 Seconds Memory Limit: 65536 KB Special JudgeA triangle is one the basic shapes in geometry. It's a polygon with three vertices and three side原创 2014-08-25 10:14:47 · 635 阅读 · 0 评论 -
Codeforces Round #259 (Div. 1) A Little Pony and Expected Maximum
A. Little Pony and Expected Maximumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputTwilight Sparkle was pla原创 2014-08-09 19:39:09 · 549 阅读 · 0 评论 -
Codeforces Round #260 (Div. 2) B. Fedya and Maths
B. Fedya and Mathstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFedya studies in a gymnasium. Fedya's mat原创 2014-08-09 19:51:36 · 739 阅读 · 0 评论 -
Matrix multiplication
Matrix multiplicationTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1155 Accepted Submission(s): 493Problem DescriptionGiv原创 2014-08-05 22:46:57 · 664 阅读 · 0 评论 -
JZP Set
Problem Description一个{1, ..., n}的子集S被称为JZP集,当且仅当对于任意S中的两个数x,y,若(x+y)/2为整数,那么(x+y)/2也属于S。例如,n=3,S={1,3}不是JZP集,因为(1+3)/2=2不属于S。但是{1,2,3}的其他子集都属于S,所以n=3时有7个JZP集给定n,求JZP集的个数。 Input第一行为T,表示输入原创 2014-05-26 13:22:45 · 662 阅读 · 0 评论 -
Meeting point-1
很久没写题解了,昨天做了一次小lanxi2012 Multi-University Training Contest 2原创 2014-05-04 12:20:32 · 694 阅读 · 0 评论 -
Meeting point-2
在做完qi原创 2014-05-04 12:33:47 · 583 阅读 · 0 评论 -
poj 1286 Necklace of Beads
Necklace of BeadsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6302 Accepted: 2628DescriptionBeads of red, blue or green colors are connected togeth原创 2014-03-21 16:45:24 · 617 阅读 · 0 评论 -
poj2409 Let it Bead
Let it BeadTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4261 Accepted: 2798Description"Let it Bead" company is located upstairs at 700 Cannery Row原创 2014-03-21 12:45:36 · 546 阅读 · 0 评论 -
poj 1269 Intersecting Lines
DescriptionWe all know that a pair of distinct points on a plane defines a line and that a pair of lines on a plane will intersect in one of three ways: 1) no intersection because they are paralle原创 2013-08-31 12:56:17 · 679 阅读 · 0 评论 -
poj 1654 Area
DescriptionYou are going to compute the area of a special kind of polygon. One vertex of the polygon is the origin of the orthogonal coordinate system. From this vertex, you may go step by step to原创 2013-08-16 22:31:36 · 664 阅读 · 0 评论 -
矩阵快速幂
先定义矩阵数据结构: struct Mat { double mat[N][N];};O(N^3)实现一次矩阵乘法Mat operator * (Mat a, Mat b) { Mat c; memset(c.mat, 0, sizeof(c.mat)); int i, j, k; for(k = 0; k < n; ++k)原创 2013-08-12 16:46:20 · 617 阅读 · 0 评论 -
poj2318 TOYS
DescriptionCalculate the number of toys that land in each bin of a partitioned toy box. Mom and dad have a problem - their child John never puts his toys away when he is finished playing with th原创 2013-08-20 11:24:21 · 516 阅读 · 0 评论 -
How Many Sets I
DescriptionGive a set S, |S| = n, then how many ordered set group (S1, S2, ..., Sk) satisfies S1 ∩ S2 ∩ ... ∩ Sk = ∅. (Si is a subset of S, (1 i k))InputThe input contains multiple c原创 2013-08-07 10:09:54 · 688 阅读 · 0 评论 -
Bloodsucker
DescriptionIn 0th day, there are n-1 people and 1 bloodsucker. Every day, two and only two of them meet. Nothing will happen if they are of the same species, that is, a people meets a people or a原创 2013-08-07 10:04:33 · 922 阅读 · 0 评论 -
Little Keng
DescriptionCalculate how many 0s at the end of the value below:1n + 2n + 3n + ... + mnInputThere are multiple cases. For each cases, the input containing two integers m, n. (1原创 2013-08-07 09:55:31 · 871 阅读 · 0 评论 -
How Big Is It?
DescriptionIan's going to California, and he has to pack his things, including his collection of circles. Given a set of circles, your program must find the smallest rectangular box in which the原创 2013-07-28 15:56:39 · 1449 阅读 · 0 评论 -
hdu 4946 Area of Mushroom
Area of MushroomTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 386 Accepted Submission(s): 55Problem DescriptionTeacher Mai原创 2014-08-14 19:17:54 · 578 阅读 · 0 评论