摘要：
Description One-dimensional country has n cities, the i-th of which is located at the point xi and has population pi, and all xi, as well as all pi, a 阅读全文
摘要：
题目描述： 定义数的消除操作为选定[L，R，x]，如果数的第L到第R位上的数字都大于等于x，并且这些数都相等，那么该操作是合法的(从低位到高位编号，个位是第一位，百位是第二位……),然后将这些位数上的数减x；否则就是不合法的，不能进行操作。对一个数操作最少的次数使得这个数变成0，这个操作次数称为该数 阅读全文
摘要：
Warm up Problem Description N planets are connected by M bidirectional channels that allow instant transportation. It's always possible to travel betw 阅读全文
摘要：
Paint Pearls Problem Description Lee has a string of n pearls. In the beginning, all the pearls have no color. He plans to color the pearls to make it 阅读全文
摘要：
吉哥系列故事——完美队形II Problem Description 吉哥又想出了一个新的完美队形游戏！ 假设有n个人按顺序站在他的面前，他们的身高分别是h[1], h[2] ... h[n]，吉哥希望从中挑出一些人，让这些人形成一个新的队形，新的队形若满足以下三点要求，则就是新的完美队形： 1、挑 阅读全文
摘要：
Dire Wolf Problem Description Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, Dire Wolves app 阅读全文
摘要：
1072: [SCOI2007]排列perm Description 给一个数字串s和正整数d, 统计s有多少种不同的排列能被d整除（可以有前导0）。例如123434有90种排列能被2整除，其中末位为2的有30种，末位为4的有60种。 给一个数字串s和正整数d, 统计s有多少种不同的排列能被d整除（ 阅读全文
摘要：
D. Dividing Kingdom II D. Dividing Kingdom II Long time ago, there was a great kingdom and it was being ruled by The Great Arya and Pari The Great. Th 阅读全文
摘要：
E. The Values You Can Make Pari wants to buy an expensive chocolate from Arya. She has n coins, the value of the i-th coin is ci. The price of the cho 阅读全文
摘要：
D. Kay and Snowflake After the piece of a devilish mirror hit the Kay's eye, he is no longer interested in the beauty of the roses. Now he likes to wa 阅读全文