snowy_smile的博客

Shortest PathTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 1073    Accepted Submission(s): 340Problem DescriptionThere is a path

Bomber Man wants to bomb an Array.  Accepts: 56  Submissions: 225 Time Limit: 4000/2000 MS (Java/Others)  Memory Limit: 65536/65536 K (Java/Others)问题描述给一个长度为 NN 的一维格子和一些炸弹的位置

Modulo QueryTime Limit: 2 Seconds      Memory Limit: 65536 KB One day, Peter came across a function which looks like:F(1, X) = X mod A1.F(i, X) = F(i - 1, X) mod Ai, 2 ≤ i ≤ N.Where

DertouzosAccepts: 76Submissions: 1357Time Limit: 7000/3500 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)问题描述正整数xxx称为nnn的positive proper divisor, 当且仅当x∣nx | nx∣n并且1≤

ColmerauerAccepts: 32Submissions: 121Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)问题描述Peter有一个n×mn \times mn×m的矩阵MMM. 定义S(a,b)S(a,b)S(a,b)为MM

PredictionTime Limit: 5000/2500 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 356    Accepted Submission(s): 63Problem DescriptionThere is a graph G =\l

Independent SetTime Limit: 1 Second      Memory Limit: 65536 KB      Special JudgeChiaki has a positive integer m and she would like to construct a tree with at most 15 vertices in such a mann

调和序列发布时间: 2017年7月9日 18:17   最后更新: 2017年7月9日 21:05   时间限制: 1000ms   内存限制: 128M描述给定一个长度为n的非负整数序列，下标为0,1,…,n−1. 定义：sequence(K)： 由下标为K的倍数组成的子序列,即下标为0,K,2K,...,[n−1/k]∗kquery(K,S):