2014年10月1日

【模拟】【HDU1443】 Joseph

摘要： Joseph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 1652 Accepted Submission(s): 103... 阅读全文

posted @ 2014-10-01 20:10 DDUPzy 阅读(125) 评论(0) 推荐(0) 编辑

【类似N^N做法的斐波那契数列】【HDU1568】 Fibonacci

摘要： Fibonacci Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3562 Accepted Submission(s): ... 阅读全文

posted @ 2014-10-01 15:50 DDUPzy 阅读(148) 评论(0) 推荐(0) 编辑

【取对数+科学计数法】【HDU1060】 N^N

摘要： Leftmost Digit Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2519 Accepted Subm... 阅读全文

posted @ 2014-10-01 13:48 DDUPzy 阅读(405) 评论(0) 推荐(0) 编辑

【枚举+数学】【HDU1271】整数对 难度：五颗星

摘要： 整数对 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2572 Accepted Submission(s): 879 ... 阅读全文

posted @ 2014-10-01 11:52 DDUPzy 阅读(150) 评论(0) 推荐(0) 编辑

【欧拉函数】【HDU1286】 找新朋友

摘要： 找新朋友 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7651 Accepted Submission(s): 4033 ... 阅读全文

posted @ 2014-10-01 00:51 DDUPzy 阅读(142) 评论(0) 推荐(0) 编辑

【筛素数表证明】【O[n]】

摘要： void get_prime(){ int cnt = 0; for (int i = 2; i < N; i++) { if (!tag[i]) p[cnt++] = i; for (int j = 0; j < cnt && p[j] * ... 阅读全文

posted @ 2014-10-01 00:35 DDUPzy 阅读(162) 评论(0) 推荐(0) 编辑

导航