NewPanderKing - 博客园

斐波那契数列

摘要：斐波那契数列的发明者，是意大利数学家列昂纳多·斐波那契（Leonardo Fibonacci，生于公元1170年，卒于1240年，籍贯大概是比萨）。他被人称作“比萨的列昂纳多”。1202年，他撰写了《珠算原理》(Liber Abacci)一书。他是第一个研究了印度和阿拉伯数学理论的欧洲人。他的父亲被比萨的一家商业团体聘任为外交领事，派驻地点相当于今日的阿尔及利亚地区，列昂纳多因此得以在一个阿拉伯老师的指导下研究数学。他还曾在埃及、叙利亚、希腊、西西里和普罗旺斯研究数学。斐波那契数列通项公式斐波那契数列指的是这样一个数列：1、1、2、3、5、8、13、21、…… 这个数列从第三项开始阅读全文

posted @ 2011-07-26 16:04 NewPanderKing 阅读(7552) 评论(0) 推荐(1)

辗转相除法

摘要：自从转载了来自圣经的算法一文后，就想把这些算法比较详细地搞清楚，先拿辗转相除法开刀了，谁让她最简单呢。呵呵。下面的大部分内容来自维基百科。辗转相除法，又被称为欧几里德（Euclidean）算法，是求最大公约数的算法。辗转相除法首次出现于欧几里得的《几何原本》（第VII卷，命题i和ii）中，而在中国则可以追溯至东汉出现的《九章算术》。两个数的最大公约数是指能同时整除它们的最大正整数。辗转相除法的基本原理是：两个数的最大公约数等于它们中较小的数和两数之差的最大公约数。例如，252和105的最大公约数是21（252 = 21 × 12；105 = 21 × 5）；因为25 阅读全文

posted @ 2011-07-25 16:13 NewPanderKing 阅读(37282) 评论(0) 推荐(9)

如何将循环小数化为分数

摘要：一、无限循环小数怎样化为分数? 公式第一种：这个公式必须将循环节的开头放在十分位。若不是可将原数乘10^x(x为正整数）就为：12.121212……-0.121212……=12 100倍 - 1倍 =99 （99和12之间一条分数线）此公式需用两位数字，其中两位数差出一个循环节。再举一个例子：0.00121212…… 公式就变为：1212.121212……-12.121212……=1200 100000 倍 - 1000倍 =99000 （1200与99000之间一条分数线）第一行为原数的的倍数10^x(x为正整数），第二行为与原数的乘数，10^x(x为正整数）。第二种：如，将阅读全文

posted @ 2011-07-25 16:07 NewPanderKing 阅读(4390) 评论(0) 推荐(0)

Leftmost Digit

摘要： Leftmost DigitTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 453 Accepted Submission(s): 229Problem DescriptionGiven a positive integer N, you should output the leftmost digit of N^N.InputThe input contains several test cases. The first line of t 阅读全文

posted @ 2011-07-24 16:12 NewPanderKing 阅读(723) 评论(0) 推荐(0)

Elevator

摘要： Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified order. It costs 6 seconds to move the elevator up one floor, and 4 seconds to move down one floor. The 阅读全文

posted @ 2011-07-23 16:35 NewPanderKing 阅读(272) 评论(0) 推荐(0)

Text Reverse

摘要： Text ReverseTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1027 Accepted Submission(s): 334Problem DescriptionIgnatius likes to write words in reverse way. Given a single line of text which is written by Ignatius, you should reverse all the words 阅读全文

posted @ 2011-07-23 16:34 NewPanderKing 阅读(1191) 评论(0) 推荐(0)

Box of Bricks

摘要： Box of BricksTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1450 Accepted Submission(s): 335Problem DescriptionLittle Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I\&# 阅读全文

posted @ 2011-07-23 16:30 NewPanderKing 阅读(1298) 评论(0) 推荐(0)

Nasty Hacks

摘要： Nasty HacksTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 483 Accepted Submission(s): 345Problem DescriptionYou are the CEO of Nasty Hacks Inc., a company that creates small pieces of malicious software which teenagers may useto fool their friend 阅读全文

posted @ 2011-07-23 16:29 NewPanderKing 阅读(365) 评论(0) 推荐(0)

The Seven Percent Solution

摘要： The Seven Percent SolutionTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 466 Accepted Submission(s): 307Problem DescriptionUniform Resource Identifiers (or URIs) are strings like http://icpc.baylor.edu/icpc/, mailto:foo@bar.org, ftp://127.0.0.1/p 阅读全文

posted @ 2011-07-23 16:28 NewPanderKing 阅读(1067) 评论(0) 推荐(0)

Identity Card

摘要： Identity CardTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 995 Accepted Submission(s): 310Problem DescriptionDo you own an ID card?You must have a identity card number in your family's Household Register. From the ID card you can get specifi 阅读全文

posted @ 2011-07-23 16:27 NewPanderKing 阅读(3149) 评论(0) 推荐(0)