![](https://img-blog.csdnimg.cn/20200408111715626.jpg?x-oss-process=image/resize,m_fixed,h_224,w_224)
ICPC-数列
文章平均质量分 82
数列有关题解
海岛Blog
专注于程序设计及其竞赛,专注于集成电路EDA设计
展开
-
HDU1568 Fibonacci【斐波拉契数列】
FibonacciTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7554 Accepted Submission(s): 3572Problem Description2007年到来了。经过2006年一年的修炼,数学神童zouyu终于把0到100000000的Fibonacci数列(f[0]=0,f[1]=1;f[i] = f[i-原创 2021-08-13 21:03:04 · 199 阅读 · 0 评论 -
UVA10190 Divide, But Not Quite Conquer!【等差数列】
Your goal in this problem is to divide a certain integer n by another integer m until n = 1, obtaining a sequence of numbers. Lets call a[i] each number of this sequence, and let’s say it has k numbers (i.e. you must do k − 1 succesive divisions to reach n原创 2021-05-06 01:01:38 · 251 阅读 · 0 评论 -
UVA12464 Professor Lazy, Ph.D.【递推函数】
Professors are very motivated when they have to travel abroad for a conference (of course, if fees are paid by the university), but they don’t have the same attitude when the moment to grade exams arrives. Professor Lazy, Ph.D., has原创 2021-04-20 18:10:26 · 175 阅读 · 0 评论 -
UVA10450 POJ1953 World Cup Noise【斐波那契数列】
World Cup NoiseTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23379 Accepted: 10359DescriptionBackground“KO-RE-A, KO-RE-A” shout 54.000 happy football fans after their team has reach...原创 2020-04-27 23:54:03 · 431 阅读 · 0 评论 -
UVA10689 Yet another Number Sequence【数列+矩阵快速幂】
Let’s define another number sequence, given by the following function:f(0) = af(1) = bf(n) = f(n − 1) + f(n − 2), n > 1 When a = 0 and b = 1, this sequence gives the Fibonacci Sequence. Ch...原创 2018-08-03 10:32:58 · 416 阅读 · 0 评论 -
POJ2229 HDU2709 Sumsets【数列】
SumsetsTime Limit: 2000MS Memory Limit: 200000K Total Submissions: 23695 Accepted: 9112 DescriptionFarmer John commanded his cows to search for different sets of numbers that s...原创 2018-08-28 20:52:08 · 504 阅读 · 0 评论 -
UVA11660 Look-and-Say sequences【数列+模拟】
A look-and-say sequence is a sequence of integers, expressed in decimal notation, where each sucessive term is generated by describing the previous one. For instance, if x 1 (t...原创 2019-03-17 09:52:42 · 523 阅读 · 0 评论 -
UVA11970 Lucky Numbers【数列】
Every person has its own numbers that he considers lucky. Usually the numbers are fixed like 3 or 7 and do not depend on anything. This lucky number model seems to be very primitive for John, so he de...原创 2019-04-20 18:00:53 · 655 阅读 · 0 评论 -
UVA11028 Sum of Product【数列】
Given n, there can be n! circular arrangement of the numbers 0 to n − 1. Lets represent every permutation as P1 P2 P3 . . . Pn! SOP(Pk) = sum of product...原创 2019-04-20 18:29:24 · 572 阅读 · 0 评论 -
UVA974 Kaprekar Numbers【Kaprekar数】
Shri Dattathreya Ramachandra Kaprekar was an Indian mathematician, whose name is associated with a number of concepts in number theory. He was born in Dahanu, near Mumbai, in India. Even as a small ch...原创 2019-04-20 23:23:25 · 566 阅读 · 0 评论 -
UVA962 Taxicab Numbers【数】
The famous mathematician Hardy relates the following episode with the (now also famous) Indian mathematician Ramanujan:I remember once going to see him when he was ill at Putney. I had ridden in taxi...原创 2019-04-21 06:35:56 · 639 阅读 · 0 评论 -
UVA10049 Self-describing Sequence【数列】
Solomon Golomb’s self–describing sequence 〈f(1), f(2), f(3), . . .〉 is the only nondecreasing sequence of positive integers with the property that it contains exactly f(k) occurrences of k for each k....原创 2018-08-03 10:20:44 · 801 阅读 · 0 评论 -
UVA10408 Farey sequences【数列】
A fraction h/k is called a proper fraction if it lies between 0 and 1 and if h and k have no common factors. For any natural number n ≥ 1, the Farey sequence of order n, Fn, is the sequence of all pro...原创 2018-08-03 17:26:34 · 534 阅读 · 0 评论 -
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 times? Following figure shows the situations when t...原创 2018-05-05 18:23:00 · 427 阅读 · 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 > 1Write a program which calculates Mn = Fn mod 2^m for...原创 2018-02-14 00:19:21 · 582 阅读 · 1 评论 -
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 range [3, 9] is 3 + 5 + 7 + 9 = 24.InputThere can b...原创 2018-02-10 00:03:32 · 585 阅读 · 0 评论 -
HDU5053 the Sum of Cube【数列】
the Sum of Cube Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3394 Accepted Submission(s): 1424 Problem DescriptionA range...原创 2018-02-09 18:02:31 · 541 阅读 · 0 评论 -
POJ2601 Simple calculations【数列】
Simple calculationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6934 Accepted: 3442DescriptionThere is a sequence of n+2 elements a0, a1, ..., an+1 (n <= 3000, -1000 <= ai <=1000...原创 2018-02-08 08:26:08 · 412 阅读 · 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 a0, an+1, c1, . . . , cn. Write a program which ca...原创 2018-02-08 08:14:12 · 372 阅读 · 0 评论 -
NUC1016 斐波那契数列【打表】
斐波那契数列时间限制: 1000ms 内存限制: 65536KB问题描述“斐波那契数列”的发明者,是意大利数学家列昂纳多?斐波那契(生于公元1170年,籍贯大概是比萨,卒于1240年后)。他还被人称作“比萨的列昂纳多”。1202年,他撰写了《珠算原理》一书。斐波那契数列衍生于《珠算原理》中的一道题目:某人把一对兔子放入一个四面被高墙围住的地方。假设每对兔子每月能生下一对小兔,而每对新生小兔从第二个...原创 2017-04-29 08:53:57 · 2256 阅读 · 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 Submission(s): 2584Problem DescriptionFamous Harry Potter,...原创 2018-03-25 20:22:11 · 785 阅读 · 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 Submission(s): 617Problem DescriptionIn mathematical terms,...原创 2018-03-28 21:53:54 · 391 阅读 · 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 Your task is to compute some values of this...原创 2018-04-06 00:35:47 · 442 阅读 · 0 评论 -
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(s): 1215Problem DescriptionThe Fibonacci sequence i...原创 2018-04-25 11:48:51 · 508 阅读 · 0 评论 -
CodeForces-450B Jzzhu and Sequences【数列+矩阵快速幂】
B. Jzzhu and Sequencestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJzzhu has invented a kind of sequences, they meet the following property:You ...原创 2018-03-01 22:59:49 · 1117 阅读 · 1 评论