摘要：
Problem Description The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the... 阅读全文
摘要：
Problem DescriptionTeacher Mai hasnnumbersa1,a2,⋯,anandn−1operators("+", "-" or "*")op1,op2,⋯,opn−1, which are arranged in the forma1op1a2op2a3⋯an.He ... 阅读全文
摘要：
Problem DescriptionA sequence b1,b2,⋯,bn are called (d1,d2)-arithmetic sequence if and only if there exist i(1≤i≤n) such that for every j(1≤j 2 #inclu... 阅读全文
摘要：
Problem DescriptionTeacher Mai is in a maze with n rows and m columns. There is a non-negative number in each cell. Teacher Mai wants to walk from the... 阅读全文
摘要：
Problem DescriptionLee has a string of n pearls. In the beginning, all the pearls have no color. He plans to color the pearls to make it more fascinat... 阅读全文
摘要：
Network of SchoolsDescriptionA number of schools are connected to a computer network. Agreements have been developed among those schools: each school ... 阅读全文
摘要：
Problem DescriptionTo prove two sets A and B are equivalent, we can first prove A is a subset of B, and then prove B is a subset of A, so finally we g... 阅读全文
摘要：
#1156 : 彩色的树时间限制:2000ms单点时限:1000ms内存限制:256MB描述给定一棵n个节点的树，节点编号为1, 2, …, n。树中有n - 1条边，任意两个节点间恰好有一条路径。这是一棵彩色的树，每个节点恰好可以染一种颜色。初始时，所有节点的颜色都为0。现在需要实现两种操作:1.... 阅读全文
摘要：
Problem DescriptionThere are N cities in the country. Each city is represent by a matrix size of M*M. If city A, B and C satisfy that A*B = C, we say ... 阅读全文
摘要：
DescriptionYYF is a couragous scout. Now he is on a dangerous mission which is to penetrate into the enemy's base. After overcoming a series difficult... 阅读全文