xuanweiace的博客

题干： Bulls are so much better at math than the cows. They can multiply huge integers together and get perfectly precise answers ... or so they say. Farmer John wonders if their answers are correct....

题干：Given an integer N(0 ≤ N ≤ 10000), your task is to calculate N! InputOne N in one line, process to the end of file. OutputFor each N, output N! in one line. Sample Input123Sample...

题干：Bulls are so much better at math than the cows. They can multiply huge integers together and get perfectly precise answers ... or so they say. Farmer John wonders if their answers are correct. He...

题干：The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting value contains...

题干：描述 N级阶梯，人可以一步走一级，也可以一步走两级，求人从阶梯底端走到顶端可以有多少种不同的走法。输入 一个整数n，代表台阶的阶数。输出 求人从阶梯底端走到顶端可以有多少种不同的走法，输出结果的格式为大整数.输入样例 1 1输出样例 11输入样例 2 2输出样例 22输入样例 3 4输出样例 35...

题干：Problems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is a taxing experience for many computer sys...

题干：This is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, ... , 2n - 1, 2n consecutively in clockwise order on the ground to form a circle, and then, to draw some stra...

题干：描述 N级阶梯，人可以一步走一级，也可以一步走两级，求人从阶梯底端走到顶端可以有多少种不同的走法。输入 一个整数n，代表台阶的阶数。输出 求人从阶梯底端走到顶端可以有多少种不同的走法，输出结果的格式为大整数.输入样例 1 1输出样例 11输入样例 2 2输出样例 22输入样例 3 4输出样例 35...

题干：单测试点时限: 2.0 秒内存限制: 256 MB“他觉得一个人奋斗更轻松自在。跟没有干劲的人在一起厮混，只会徒增压力。”QQ 小方决定一个人研究研究进制转换。很快，QQ 小方就遇到问题了。他现在想知道在十进制范围 [l,r] 内有多少整数满足在 k 进制下末尾恰好有 m 个 0 。比如在十进制下的 24 在二进制下是 11000 ，我们称十进制下的 24 在二进制下...