摘要：
Short Program Petya learned a new programming language CALPAS. A program in this language always takes one non-negative integer and returns one non-ne 阅读全文
摘要：
懒省事的小明时间限制：3000 ms | 内存限制：65535 KB 难度：3描述 小明很想吃果子，正好果园果子熟了。在果园里，小明已经将所有的果子打了下来，而且按果子的不同种类分成了不同的堆。小明决定把所有的果子合成一堆。 因为小明比较懒，为了省力气... 阅读全文
摘要：
Find The MultipleTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 36135 Accepted: 15096Special JudgeDescriptionGiven a positi... 阅读全文
摘要：
WAJUEJI which home strong！时间限制：1000 ms | 内存限制：65535 KB 难度：2描述 在一个山沟里，姐弟俩同时考上了大学。但由于家里拮据，所以这并不是什么好消息。父亲对孩子说：我就是砸锅卖铁也要把你们姐俩供出来。 当时的姐姐已... 阅读全文
摘要：
3D dungeon时间限制：1000 ms | 内存限制：65535 KB 难度：2描述 You are trapped in a 3D dungeon and need to find the quickest way out! The dungeon is ... 阅读全文
摘要：
时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 131072K，其他语言262144K64bit IO Format: %lld题目描述珂朵莉给你一个有根树，求有多少个子树满足其内部节点编号在值域上连续一些数在值域上连续的意思即其在值域上构成一个连续的区... 阅读全文
摘要：
在无向图中，若任意两个顶点vi与vj都有路径相通，则称该无向图为连通图。（强连通图：在有向图中，若任意两个顶点vi与vj都有路径相通，则称该有向图为强连通图。）在连通图中，若图的边具有一定的意义，每一条边都对应着一个数，称为权；权代表着连接连个顶点的代价，称这种连通图... 阅读全文
摘要：
EllipseTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2418 Accepted Submis... 阅读全文
摘要：
统计难题Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀).Input输入数据的第一部分是一张单词表,每行一个单... 阅读全文
摘要：
GukiZ hates BoxesProfessor GukiZ is concerned about making his way to school, because massive piles of boxes are blocking his way.In t... 阅读全文
摘要：
k-roundingFor a given positive integer n denote its k-rounding as the minimum positive integer x, such that x ends with k or more zero... 阅读全文
摘要：
C. Marco and GCD Sequencetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn a dre... 阅读全文
摘要：
Wrathtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputHands that shed innocent bl... 阅读全文
摘要：
B. Ralph And His Magic Fieldtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputRalph... 阅读全文
摘要：
ACM ICPCIn a small but very proud high school it was decided to win ACM ICPC. This goal requires to compose as many teams of three as ... 阅读全文
摘要：
From Y to Y From beginning till end, this message has been waiting to be conveyed.For a given unordered multiset of n lowercase Englis... 阅读全文
摘要：
Union of Doubly Linked ListsDoubly linked list is one of the fundamental data structures. A doubly linked list is a sequence of elemen... 阅读全文
摘要：
Two TVsPolycarp is a great fan of television.He wrote down all the TV programs he is interested in for today. His list contains n sho... 阅读全文
摘要：
Drainage DitchesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 19857 Accep... 阅读全文
摘要：
SwapGiven an N*N matrix with each entry equal to 0 or 1. You can swap any two rows or any two columns. Can you find a way to make all ... 阅读全文