斐波那契数列
文章平均质量分 88
tomjobs
别慌,慌也没用
展开
-
Codeforces-1491 E. Fib-tree(斐波那契数列,树)
Let ???????? denote the ????-th term of Fibonacci sequence, defined as below: ????0=????1=1 for any integer ????≥0, ????????+2=????????+1+???????? You are given a tree with ???? vertices. Recall that a tree is a connected undirected graph without cycles. W原创 2021-03-01 14:08:27 · 797 阅读 · 0 评论 -
Codeforces 1452D. Radio Towers(斐波那契数列)
There are ????+2 towns located on a coordinate line, numbered from 0 to ????+1. The ????-th town is located at the point ????. You build a radio tower in each of the towns 1,2,…,???? with probability 12 (these events are independent). After that, you want原创 2020-11-21 19:01:14 · 334 阅读 · 0 评论 -
2020杭电多校第二场 The Oculus(哈希,斐波那契数列)
Problem Description Let’s define the Fibonacci sequence F1,F2,… as F1=1,F2=2,Fi=Fi−1+Fi−2 (i≥3). It’s well known that every positive integer x has its unique Fibonacci representation (b1,b2,…,bn) such that: · b1×F1+b2×F2+⋯+bn×Fn=x. · bn=1, and for each i (原创 2020-07-25 20:39:38 · 405 阅读 · 0 评论 -
杭电多校第一场 Fibonacci Sum HDU - 6755 Power of Fibonacci ZOJ - 3774(斐波那契数列幂次和)
In mathematics, Fibonacci numbers or Fibonacci series or Fibonacci sequence are the numbers of the following integer sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, … By definition, the first two numbers in the Fibonacci sequence are 1 and 1原创 2020-07-22 12:40:49 · 287 阅读 · 0 评论 -
2018北京区域赛 D - Frog and Portal HihoCoder - 1873(构造,菲波那契数)
A small frog wants to get to the other side of a river. The frog is initially located at one bank of the river (position 0) and wants to get to the other bank (position 200). Luckily, there are 199 le...原创 2019-10-13 21:33:33 · 200 阅读 · 0 评论