数学技巧
文章平均质量分 87
Rechard_chen
不积跬步无以至千里。
展开
-
Segment
DescriptionGiven n segments in the two dimensional space, write a program, which determines if there exists a line such that after projecting these segments on it, all projected segments have at原创 2014-11-04 20:51:17 · 986 阅读 · 0 评论 -
Choose and divide
The binomial coefficient C(m,n) is defined as m!C(m,n) = -------- n!(m-n)!Given four natural numbers p, q, r, and s, compute the the result of dividing C(p,q) by C(r,s原创 2014-11-03 20:48:46 · 807 阅读 · 0 评论 -
Fabled Rooks
Problem F: Fabled Rooks We would like to placen rooks, 1 ≤ n ≤ 5000, on a n×n board subject to the following restrictionsThe i-th rook can only be placed within the rectangle given by its l原创 2014-11-21 20:19:01 · 977 阅读 · 0 评论 -
Send a Table
When participating in programming contests, you sometimes face the following problem: You know how to calcutale the output for the given input values, but your algorithm is way too slow to ever pass t原创 2014-11-21 21:02:45 · 533 阅读 · 0 评论 -
HUNNU-10307-最优分解问题
点击打开题目连接# include # include # include # include # include using namespace std;int v[4] = {1,10,100,1000},a[100000];struct BigNumber{ int d[1000]; BigNumber() { memset(d,0,si原创 2015-08-10 17:57:56 · 901 阅读 · 0 评论