Problem Description 反素数就是满足对于任意i(0< i < x),都有g(i) < g(x),(g(x)是x的因子个数),则x为一个反素数。现在给你一个整数区间[a,b],请你求出该区间的x使g(x)最大。...

Problem Description lin2144是一只小菜鸟，都是笨鸟先飞，lin2144想来个菜鸟先飞，他从0点出发 一开始的飞行速度为1m/s，每过一个单位时间lin2144的飞行速

Problem Description 开学了，杭电又迎来了好多新生。ACMer想为新生准备一个节目。来报名要表演节目的人很多，多达N个，但是只需要从这N个人中选M个就够了，一共有多少种选择方法？...

Problem Description You are the CEO of Nasty Hacks Inc., a company that creates small pieces of malicious software which teenagers may use to fool their fri...

Problem Description The International Clown and Pierrot Competition (ICPC), is one of the most distinguished and also the most popular events on earth in the ...

Problem Description Roy has just moved into a new apartment. Well, actually the apartment itself is not very new, even dating back to the days before people h...

Problem Description A DFS(digital factorial sum) number is found by summing the factorial of every digit of a positive integer.

Problem Description 凡看过功夫熊猫这部电影的人都会对影片中那只憨憨的熊猫阿波留下相当深的印象，胖胖的熊猫阿波自从打败了凶狠强悍的雪豹泰龙以后，在和平谷的地位是越来越高，成为谷中第一的功夫大师。并因此他父亲...

Problem Description As the increase of population, the living space for people is becoming smaller and smaller. In MagicStar the problem is much worse. Dr. Ma...

Problem Description A有1数m，B来猜.B每猜一次，A就说”太大”，”太小”或”对了” 。 问B猜n次可以猜到的最大数。