xtulollipop

DescriptionWANGPENG is a freshman. He is requested to have a physical examination when entering the university. Now WANGPENG arrives at the hospital. Er….. There are so many students, and the nu

Description Two pirates Polycarpus and Vasily play a very interesting game. They have n chests with coins, the chests are numbered with integers from 1 to n. Chest number i has ai coins.Polycarpus and

DescriptionHere is a famous story in Chinese history. "That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to play horse racing with the king and oth

Problem Description You are given two numbers N and M.Every step you can get a new N in the way that multiply N by a factor of N.Work out how many steps can N be equal to M at least.If N can’t be to M

DescriptionJohn在做一个项目，项目对存储容量有着近乎苛刻的要求，为此John需要对一些东西进行压缩存储。John的第一个问题就是一大堆的字符串，存储它们太占地方了，为此他想了一个办法：如果字符串具有相同的后缀，那么就把这么字符串的相同后缀和在一起，这样就能节约一点空间了。比如说有两个字符串分别为“Programming”和“Something”,这样它们有相同的后缀ing,这时候就能省

Anatoly lives in the university dorm as many other students do. As you know, cockroaches are also living there together with students. Cockroaches might be of two colors: black and red. There are n coc