调用函数
淡定的小鱼
这个作者很懒,什么都没留下…
展开
-
NYOJ 480 Fibonacci Again!
Fibonacci Again!时间限制:1000 ms | 内存限制:65535 KB难度:2描述求第n个斐波那契数是否是一个素数,n为整数f[n]=f[n-1]+f[n-2] (2f[1]=3,f[2]=7输入输入整数m,0输出如果f[m]是素数 则输出Yes,否则输出No,每行输出占一行。样例输入23原创 2014-07-24 01:41:54 · 831 阅读 · 0 评论 -
HDU 2098 分拆素数和
分拆素数和Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20320 Accepted Submission(s): 8866Problem Description把一个偶数拆成两个不同素数的和,有几种原创 2014-07-24 20:35:35 · 643 阅读 · 0 评论 -
HDU 1262 寻找素数对
寻找素数对Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7750 Accepted Submission(s): 3871Problem Description哥德巴赫猜想大家都知道一点吧.我们现在不原创 2014-07-24 16:37:35 · 635 阅读 · 0 评论 -
HDU 2521 反素数
反素数Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4142 Accepted Submission(s): 2396Problem Description反素数就是满足对于任意i(0原创 2014-07-24 20:50:18 · 1383 阅读 · 0 评论 -
HDU 2503 a/b + c/d
a/b + c/dTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7733 Accepted Submission(s): 4464Problem Description给你2个分数,求他们的和,并要求原创 2014-07-25 17:11:27 · 600 阅读 · 0 评论 -
NYOJ 484 The Famous Clock
#include#includeint fun(char a[]){ if(strcmp(a,"I")==0) return 1; if(strcmp(a,"II")==0) return 2; if(strcmp(a,"III")==0) return 3; if(strcmp(a,"IV")==0) return 4; if(strcmp(a原创 2014-07-08 18:12:32 · 586 阅读 · 1 评论 -
HDU 2028 Lowest Common Multiple Plus
/*中文题意:中文翻译:题目大意:解题思路:难点详解:关键点:解题人:解题时间:2014/07/30 */原创 2014-07-30 10:36:53 · 494 阅读 · 0 评论