海岛Blog

海是无垠的,岛在海中是独立的,有一片自己的天空

UVA10334 Ray Through Glasses【大数】

Suppose we put two panes of glass back-to-back. How many ways an are there for light rays to pass through or be reflected after changing direction n ...

2018-05-05 18:23:00

阅读数:74

评论数:1

HDU3117 Fibonacci Numbers【Fibonacci数列】

Fibonacci NumbersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2897    Accepted Submission(...

2018-04-25 11:48:51

阅读数:30

评论数:0

UVA11582 Colossal Fibonacci Numbers!【快速模幂+数列模除】

The i'th Fibonacci number f(i) is recursively defined in the following way:    • f(0) = 0 and f(1) = 1    • f(i + 2) = f(i + 1) + f(i) forevery i ≥ 0...

2018-04-06 00:35:47

阅读数:56

评论数:0

HDU5018 Revenge of Fibonacci【Fibonacci数列】

Revenge of FibonacciTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1302    Accepted Submissi...

2018-03-28 21:53:54

阅读数:41

评论数:0

HDU1178 Heritage from father【水题】

Heritage from fatherTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 6899    Accepted Submiss...

2018-03-25 20:22:11

阅读数:64

评论数:0

CodeForces-450B Jzzhu and Sequences【数列+矩阵快速幂】

B. Jzzhu and Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJzzhu has invented a kind ...

2018-03-01 22:59:49

阅读数:274

评论数:0

UVA10229 Modular Fibonacci 【循环数列】

The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, ...) are defined by the recurrence:    F0 = 0    F1 = 1    Fi = Fi−1 + Fi−2 for i &am...

2018-02-14 00:19:21

阅读数:104

评论数:0

UVA10783 Odd Sum【数列】

Given a range [a, b], you are to find the summation of all the odd integers in this range. For example, the summation of all the odd integers in the ...

2018-02-10 00:03:32

阅读数:114

评论数:0

HDU5053 the Sum of Cube【数列】

the Sum of CubeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3394    Accepted Submission(s)...

2018-02-09 18:02:31

阅读数:113

评论数:0

POJ2601 Simple calculations【数列】

Simple calculationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6934 Accepted: 3442DescriptionThere is a sequence of n+2 elements a0, a1...

2018-02-08 08:26:08

阅读数:72

评论数:0

UVA10014 Simple calculations【数列】

There is a sequence of n + 2 elements a0, a1, . . . , an+1 (n ≤ 3000; −1000 ≤ ai ≤ 1000). It is known thatfor each i = 1, 2, . . . , n. You are given...

2018-02-08 08:14:12

阅读数:80

评论数:0

NUC1016 斐波那契数列【打表】

斐波那契数列时间限制: 1000ms 内存限制: 65536KB问题描述“斐波那契数列”的发明者,是意大利数学家列昂纳多?斐波那契(生于公元1170年,籍贯大概是比萨,卒于1240年后)。他还被人称作“比萨的列昂纳多”。1202年,他撰写了《珠算原理》一书。斐波那契数列衍生于《珠算原理》中的一道题...

2017-04-29 08:53:57

阅读数:686

评论数:0

POJ3438 ZOJ2886 UVALive3822 Look and Say【数列+水题】

Look and SayTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 9475 Accepted: 5773DescriptionThe look and say sequence is defined as follows. ...

2016-07-23 21:51:34

阅读数:1040

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭