摘要: "" 描述 Lele now is thinking about a simple function f(x). If x = 10 f(x) = a0 f(x 1) + a1 f(x 2) + a2 f(x 3) + …… + a9 f(x 10); And ai(0 include define 阅读全文
posted @ 2018-01-31 17:03 HackHarry 阅读(142) 评论(0) 推荐(0) 编辑
摘要: "原题链接" 描述 Queues and Priority Queues are data structures which are known to most computer scientists. The Queue occurs often in our daily life. There 阅读全文
posted @ 2018-01-31 16:59 HackHarry 阅读(113) 评论(0) 推荐(0) 编辑
摘要: "原题链接" 描述 Given a n × n matrix A and a positive integer k, find the sum $S = A + A^{2} + A^{3} + … + A^{k}.$ 输入 The input contains exactly one test ca 阅读全文
posted @ 2018-01-31 16:43 HackHarry 阅读(131) 评论(0) 推荐(0) 编辑
摘要: "原题链接" 描述 A为一个方阵,则Tr A表示A的迹(就是主对角线上各项的和),现要求Tr(A^k)%9973。 输入 数据的第一行是一个T,表示有T组数据。 每组数据的第一行有n(2 define ll long long define maxn 10 using namespace std; 阅读全文
posted @ 2018-01-31 16:30 HackHarry 阅读(104) 评论(0) 推荐(0) 编辑
摘要: "原题链接" 描述 A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find all the hat 阅读全文
posted @ 2018-01-31 16:22 HackHarry 阅读(98) 评论(0) 推荐(0) 编辑