mikku

2021年2月16日

2020 BIT冬训-二分三分快速幂矩阵 H - Fibonacci POJ - 3070 （矩阵快速幂）

摘要： In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are: 阅读全文

posted @ 2021-02-16 20:17 mikku 阅读(41) 评论(0) 推荐(0)

2020 BIT冬训-二分三分快速幂矩阵 G - Kolya and Tanya CodeForces - 584B

摘要： Problem Description Kolya loves putting gnomes at the circle table and giving them coins, and Tanya loves studying triplets of gnomes, sitting in the 阅读全文

posted @ 2021-02-16 18:26 mikku 阅读(54) 评论(0) 推荐(0)

2020 BIT冬训-二分三分快速幂矩阵 F - Weakness and Poorness CodeForces - 578C

摘要： Problem Description You are given a sequence of n integers a1, a2, ..., an. Determine a real number x such that the weakness of the sequence a1 - x, a 阅读全文

posted @ 2021-02-16 16:48 mikku 阅读(52) 评论(0) 推荐(0)

2021年2月15日

2020 BIT冬训-二分三分快速幂矩阵 E - Aggressive cows POJ - 2456

摘要： Problem Description Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. The stalls are located along a straight line at position 阅读全文

posted @ 2021-02-15 20:04 mikku 阅读(55) 评论(0) 推荐(0)

2021年2月14日

2020 BIT冬训-二分三分快速幂矩阵 D - Sand Fortress CodeForces - 985D

摘要： Problem Description You are going to the beach with the idea to build the greatest sand castle ever in your head! The beach is not as three-dimensiona 阅读全文

posted @ 2021-02-14 20:17 mikku 阅读(55) 评论(0) 推荐(0)

2021年2月13日

2020 BIT冬训-二分三分快速幂矩阵 C - Multiplication Table CodeForces - 448D

摘要： Problem Description Bizon the Champion isn't just charming, he also is very smart. While some of us were learning the multiplication table, Bizon the 阅读全文

posted @ 2021-02-13 21:30 mikku 阅读(49) 评论(0) 推荐(0)

2020 BIT冬训-二分三分快速幂矩阵 B - Error Curves HDU - 3714（三分）

摘要： Problem Description Josephina is a clever girl and addicted to Machine Learning recently. Shepays much attention to a method called Linear Discriminan 阅读全文

posted @ 2021-02-13 20:30 mikku 阅读(73) 评论(0) 推荐(0)

2020 BIT冬训-二分三分快速幂矩阵 A - Expanding Rods POJ - 1905（二分）

摘要： Problem Description When a thin rod of length L is heated n degrees, it expands to a new length L'=(1+n*C)*L, where C is the coefficient of heat expan 阅读全文

posted @ 2021-02-13 18:57 mikku 阅读(69) 评论(0) 推荐(0)

2021年2月12日

2020 BIT冬训-贪心 L - Mahmoud and a Triangle CodeForces - 766B

摘要： Problem Description Mahmoud has n line segments, the i-th of them has length ai. Ehab challenged him to use exactly 3 line segments to form a non-dege 阅读全文

posted @ 2021-02-12 17:31 mikku 阅读(60) 评论(0) 推荐(0)

2020 BIT冬训-贪心 K - USB vs. PS/2 CodeForces - 762B

摘要： Problem Description Due to the increase in the number of students of Berland State University it was decided to equip a new computer room. You were gi 阅读全文

posted @ 2021-02-12 17:16 mikku 阅读(69) 评论(0) 推荐(0)

公告