小田坎儿

题目连接：http://acm.jlu.edu.cn/joj/upload/jlp2011.pdfProblem B: Xiao Ming’s Computer Xiao Ming is a clever boy who invented a strange computer named "Xiao Ming Computer". The computer has only

快速判断一个数是否为素数：代码：typedef long long LL;LL exp_mod(LL a,LL b,LL m){ bool bit[64]; int i=0; while(b) { bit[i++] = b&1 ? 1 : 0; b >>= 1; } LL s=1; for

DescriptionA lattice point is an ordered pair (x, y) where x and y are both integers. Given the coordinates of the vertices of a triangle (which happen to be lattice points), you are to count the

DescriptionLongge is good at mathematics and he likes to think about hard mathematical problems which will be solved by some graceful algorithms. Now a problem comes: Given an integer N(1 "Oh,

Description反正切函数可展开成无穷级数，有如下公式 (其中0 使用反正切函数计算PI是一种常用的方法。例如，最简单的计算PI的方法： PI=4arctan(1)=4(1-1/3+1/5-1/7+1/9-1/11+...) 公式(2) 然而，这种方法的效率很低，但我们可以根据角度和的正切函数公式： tan(a+b)=[tan(a)+tan(b

DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given

DescriptionThe kingdom Eintagra is in great danger! Overwhelming enemy has surrounded the emperor's castle and once they enter, a massacre is just what is going to be. Now what all people in t

欧拉函数在编程中是非常重要的一个版块：φ函数的值 　通式：φ(x)=x(1-1/p1)(1-1/p2)(1-1/p3)(1-1/p4)…..(1-1/pn),其中p1, p2……pn为x的所有质因数，x是不为0的整数。φ(1)=1（唯一和1互质的数就是1本身）。 (注意：每种质因数只一个。比如12=2*2*3  欧拉公式那么φ（12）=12*（1-1/2）*

DescriptionConsider a sequence Fi that satisfies the following conditions:Find the number of different divisors of Fn.InputInput file contains the only integer number

DescriptionDefine f(n) as the number of ways to perform n in format of the sum of some positive integers. For instance, when n=4, we have   4=1+1+1+1   4=1+1+2   4=1+2+1   4=2+1+1   4=1+

DescriptionThe Rascal Triangle definition is similar to that of the Pascal Triangle. The rows are numbered from the top starting with 0. Each rown contains n + 1 numbers indexed from 0 to n.

DescriptionRuslan has K friends. And all of them have birthday tomorrow. He has bought N different photo albums yesterday, and wants to present these photo albums to his friends. Of course, he

DescriptionN children standing in circle who are numbered 1 through N clockwise are waiting their candies. Their teacher distributes the candies by in the following way:First the teacher gives c

DescriptionThe branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians for thousands of years is the qu