随笔分类 -  数论

【hdu - 1715 大菲波数（水题、、罪过）】
摘要：大菲波数Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6572Accepted Submission(s): 2157Problem DescriptionFibonacci数列，定义如下：f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n>=3。计算第n项Fibonacci数值。Input输入第一行为一个整数N，接下来N行为整数Pi（1<=Pi<=1000）。Output输出为N行，每行为对应的f(Pi)。Sa 阅读全文
posted @ 2012-08-03 09:24 ismdeep 阅读(214) 评论(0) 推荐(0)
【最大因子数】
摘要：最大因子数Time Limit : 10000/5000ms (Java/Other)Memory Limit : 65535/65535K (Java/Other)Total Submission(s) : 39Accepted Submission(s) : 17Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem Description定义f(n)为整数n的因子数，如f(9) = 3（分别是1,3,9）.定义g(n)=k,整数k是满足f(k) = max{f(i)|0<i<=n}的最小整数,现在给出n让你求g(n).I 阅读全文
posted @ 2012-07-24 10:36 ismdeep 阅读(551) 评论(0) 推荐(0)
【hdu - 2662 Coin】
摘要：CoinTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 662Accepted Submission(s): 329Problem DescriptionMoon has many coins, but only contains two value types which is 5 cents and 7 cents, Some day he find that he can get any value which greater than 阅读全文
posted @ 2012-07-20 11:25 ismdeep 阅读(618) 评论(0) 推荐(0)
【hdu - 1018 n! 的位数】
摘要：Big NumberTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15735Accepted Submission(s): 6954Problem DescriptionIn many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, 阅读全文
posted @ 2012-07-19 10:23 ismdeep 阅读(161) 评论(0) 推荐(0)
【nyist - 102 次方求模】
摘要：次方求模时间限制：1000ms | 内存限制：65535KB难度：3描述求a的b次方对c取余的值输入第一行输入一个整数n表示测试数据的组数（n<100）每组测试只有一行，其中有三个正整数a,b,c(1=<a,b,c<=1000000000)输出输出a的b次方对c取余之后的结果样例输入32 3 53 100 1011 12345 12345样例输出3110481来源[张云聪]原创上传者张云聪 1 // Project name : 102 2 // File name : main.cpp 3 // Author : Izumu 4 // Date & Time : W 阅读全文
posted @ 2012-07-18 10:51 ismdeep 阅读(200) 评论(0) 推荐(0)
【hdu - 1787 GCD Again （数论、欧拉函数）】
摘要：GCD AgainTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1314Accepted Submission(s): 487Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after one ACM contest?No? Oh, you must do this when you want to 阅读全文
posted @ 2012-07-17 16:08 ismdeep 阅读(259) 评论(0) 推荐(0)
【hdu - 3501 (数论、欧拉函数)】
摘要：Calculation 2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1121Accepted Submission(s): 479Problem DescriptionGiven a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said 阅读全文
posted @ 2012-07-13 20:36 ismdeep 阅读(402) 评论(0) 推荐(1)
【poj - 2478 Farey Sequence （欧拉函数、数论）】
摘要：Farey SequenceTime Limit:1000MSMemory Limit:65536KTotal Submissions:9180Accepted:3501DescriptionThe Farey Sequence Fn for any integer n with n >= 2 is the set of irreducible rational numbers a/b with 0 < a < b <= n and gcd(a,b) = 1 arranged in increasing order. The first few areF2 = {1/2 阅读全文
posted @ 2012-07-13 17:11 ismdeep 阅读(209) 评论(0) 推荐(0)
【poj - 2407 欧拉函数】
摘要：RelativesTime Limit:1000MSMemory Limit:65536KTotal Submissions:8841Accepted:4134DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = xy a 阅读全文
posted @ 2012-07-13 16:23 ismdeep 阅读(169) 评论(0) 推荐(0)
【数论 - 除法表达式】
摘要：除法表达式Time Limit(Common/Java):1000MS/10000MS Memory Limit:65536KByteTotal Submit: 279 Accepted: 68Description给出如下除法表达式E：X1/X2/X3/..../Xk其中Xi是正整数并且Xi<=2000000000(1<=i<=k,k<=10000)。除法表达式应当按照从左到右的顺序求结果，例如表达式1/2/1/2的值是1/4。现在让你可以在表达E中嵌入括号以改变计算顺序，例如表达式(1/2)/(1/2)的值是1。现在给你一个除法表达式E，要求告诉是否能够通过加括号（ 阅读全文
posted @ 2012-07-12 17:03 ismdeep 阅读(704) 评论(0) 推荐(0)
【hdu - 1061 Rightmost Digit】
摘要：Rightmost DigitTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18122Accepted Submission(s): 6946Problem DescriptionGiven a positive integer N, you should output the most right digit of N^N.InputThe input contains several test cases. The first line 阅读全文
posted @ 2012-07-09 09:43 ismdeep 阅读(344) 评论(2) 推荐(0)
【hdu - 1164 Eddy's research I】
摘要：Eddy's research ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3554Accepted Submission(s): 2182Problem DescriptionEddy's interest is very extensive, recently he is interested in prime number. Eddy discover the all number owned can be divi 阅读全文
posted @ 2012-07-08 21:17 ismdeep 阅读(185) 评论(0) 推荐(0)