训练2
文章平均质量分 81
Pure_W
博主很懒=w=
展开
-
【hihocoder1430】 A Boring Problem
【hihocoder1430】 A Boring Problem大意: 给定n个数字序列S,定义 F(j,i)=(S[j]+S[j+1]+…+S[i−1]+S[i])kF(j, i) =(S[j] + S[j+1] + … + S[i-1] + S[i]) ^ k,原创 2017-02-28 08:48:33 · 767 阅读 · 0 评论 -
【CodeForces】- 739C Alyona and towers
Alyona has built n towers by putting small cubes some on the top of others. Each cube has size 1 × 1 × 1. A tower is a non-zero amount of cubes standing on the top of each other. The towers are next to原创 2016-12-28 22:35:13 · 643 阅读 · 0 评论