数论
changhaiSmile
这个作者很懒,什么都没留下…
展开
-
Let the Balloon Rise
Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 79749 Accepted Submission(s): 29980 Problem Description Contest原创 2015-01-09 10:48:47 · 512 阅读 · 0 评论 -
Digital Roots
Digital Roots Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 52224 Accepted Submission(s): 16315 Problem Description The digital root原创 2015-01-11 09:19:11 · 639 阅读 · 0 评论 -
find the nth digit
find the nth digit Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8801 Accepted Submission(s): 2504 Problem Description 假设: S1 = 1原创 2015-01-14 10:56:03 · 570 阅读 · 0 评论 -
青蛙爬井
青蛙爬井 Time Limit: 1 Sec Memory Limit: 128 MB Submit: 2079 Solved: 1423 SubmitStatusWeb Board Description 有一口深度为high米的水井,井底有一只青蛙,它每天白天能够沿井壁向上爬up米,夜里则顺井壁向下滑down米,若青蛙从某个早晨开始向外爬,对于任意指定的high、up原创 2015-01-14 09:11:52 · 2036 阅读 · 1 评论 -
蟠桃记
蟠桃记 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 39108 Accepted Submission(s): 29329 Problem Description 喜欢西游记的同学肯定都知道悟空偷吃蟠桃的故事,你原创 2015-01-14 15:04:05 · 425 阅读 · 0 评论 -
错排公式
错排公式 错排公式推导: 1、当N=1和2时,易得解~,假设F(N-1)和F(N-2)已经得到,重点分析下面的情况: 2、当有N封信的时候,前面N-1封信可以有N-1或者 N-2封错装. 3、前者,对于每种错装,可从N-1封信中任意取一封和第N封错装,故有F(N-1)*(N-1)种. 4、后者简单,只能是没装错的那封和第N封交换信封,没装错的那封可以是前面N-1封中的任意一个原创 2015-01-14 16:20:53 · 715 阅读 · 0 评论 -
不容易系列之一
不容易系列之一 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 15522 Accepted Submission(s): 6415 Problem Description 大家常常感慨,要做好一件事情真的不容易,确实,原创 2015-01-14 16:33:47 · 477 阅读 · 0 评论 -
欧几里得算法
辗转相除法(欧几里得算法) ---最大公约数 int gcd(int a,int b) { return b==0 ? a : gcd(b , a%b); } ---最小公倍数(先除后乘,防止溢出) a/gcd(a,b)*b原创 2015-01-17 10:12:52 · 377 阅读 · 0 评论 -
献给杭电五十周年校庆的礼物
献给杭电五十周年校庆的礼物 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7897 Accepted Submission(s): 4325 Problem Description 或许你曾经牢骚满腹 或许你依然原创 2015-01-16 09:54:54 · 616 阅读 · 0 评论 -
Climbing Worm
Climbing Worm Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13174 Accepted Submission(s): 8878 Problem Description An inch worm is原创 2015-01-13 10:00:37 · 537 阅读 · 0 评论 -
Encoding
Encoding Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28533 Accepted Submission(s): 12642 Problem Description Given a string contai原创 2015-01-12 10:14:12 · 544 阅读 · 0 评论 -
Rightmost Digit
Rightmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 35128 Accepted Submission(s): 13337 Problem Description Given a positi原创 2015-01-13 09:34:31 · 476 阅读 · 0 评论 -
Heritage from father
Heritage from father Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others) Total Submission(s): 5178 Accepted Submission(s): 1837 Problem Description Famous Har原创 2015-01-10 16:13:33 · 453 阅读 · 0 评论 -
Elevator
Elevator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 47184 Accepted Submission(s): 26027 Problem Description The highest building原创 2015-01-09 17:47:40 · 626 阅读 · 0 评论 -
Fibonacci Again
Fibonacci Again Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 39792 Accepted Submission(s): 19088 Problem Description There are an原创 2015-01-10 10:12:27 · 566 阅读 · 0 评论 -
u Calculate e
u Calculate e Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 32719 Accepted Submission(s): 14683 Problem Description A simple mathema原创 2015-01-10 21:39:28 · 489 阅读 · 0 评论 -
Uniform Generator
Uniform Generator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 18735 Accepted Submission(s): 7348 Problem Description Computer simu原创 2015-01-11 10:17:55 · 921 阅读 · 0 评论 -
Least Common Multiple
Least Common Multiple Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 33455 Accepted Submission(s): 12636 Problem Description The le原创 2015-01-11 10:42:03 · 641 阅读 · 0 评论 -
Number Sequence
Number Sequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 113360 Accepted Submission(s): 27537 Problem Description A number se原创 2015-01-10 14:43:37 · 443 阅读 · 0 评论 -
Leftmost Digit
Leftmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 13880 Accepted Submission(s): 5304 Problem Description Given a positive原创 2015-01-10 19:35:38 · 469 阅读 · 0 评论 -
筛选法构造素数表
筛选法构造素数表 Eratosthenes筛选法构造1~n的素数表 筛选的代码如下: 筛选的思想:对于不超过n的每个非负整数p,删除2p,3p,4p ,… ,当处理完所有数之后,还没有被删除的就是素数。如果用vis[i]表示i已经被删除,筛选的代码可以写成如下: memset(vis,0,sizeof(vis)); for(int i=2;i原创 2015-01-17 11:25:30 · 516 阅读 · 0 评论