弱的奋斗之旅

求斐波那契数列第 n 项#include#include#includeusing namespace std;typedef vector vec;typedef vector mat;const int mod = 10000;mat mul(mat A, mat B){ mat C(A.size(), vec(B[0].size(

题意A sequence S n is defined as: Where a, b, n, m are positive integers.┌x┐is the ceil of x. For example, ┌3.14┐=4. You are to calculate S n. There are several test cases, each test case in one li

题意给出一个图，其中有 a b 两点。问从 a 到 b 恰好经过 k 个点的路径有几种。

题意Given N and K, you have to find(1^K + 2^K + 3^K + … + N^K) % 2^32

Quad TilingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4363 Accepted: 1996DescriptionTired of the Tri Tiling game finally, Michael turns to a more

Matrix Power SeriesTime Limit: 3000MS Memory Limit: 131072KTotal Submissions: 22749 Accepted: 9503DescriptionGiven a n × n matrix A and a positive integer k,

BlocksTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6657 Accepted: 3217DescriptionPanda has received an assignment of painting a line of blocks. Sin