摘要：Fibonacci again and again 任何一个大学生对菲波那契数列(Fibonacci numbers)应该都不会陌生，它是这样定义的： F(1)=1; F(2)=2; F(n)=F(n-1)+F(n-2)(n>=3); 所以，1,2,3,5,8,13……就是菲波那契数列。 在HDOJ 阅读全文

摘要：推论：小于N且与N互质的所有数的和（包括1）为 N*vola（N）/2 Given a positive integer N, your task is to calculate the sum of the positive integers less than N which are not c 阅读全文

摘要：The input contains N natural (i.e. positive integer) numbers ( N <= 10000 ). Each of that numbers is not greater than 15000. This numbers are not nece 阅读全文

摘要：The branch of mathematics called number theory is about properties of numbers. One of the areas that has captured the interest of number theoreticians 阅读全文