随笔分类 -  ----数论----

hdu 6198(矩阵快速幂)
摘要:number number number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 175 Accepted Submission(s): 阅读全文

posted @ 2017-09-10 23:01 见字如面 阅读(288) 评论(0) 推荐(0)

hdu 6112 今夕何夕(模拟)
摘要:今夕何夕 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 484 Accepted Submission(s): 151 Problem Desc 阅读全文

posted @ 2017-08-12 19:19 见字如面 阅读(293) 评论(0) 推荐(0)

CodeForces - 735D Taxes (哥德巴赫猜想)
摘要:Taxes time limit per test 2 seconds time limit per test memory limit per test 256 megabytes memory limit per test input standard input input output st 阅读全文

posted @ 2017-08-11 15:29 见字如面 阅读(235) 评论(0) 推荐(0)

hdu 1695(莫比乌斯反演)
摘要:GCD Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12004 Accepted Submission(s): 4531 Problem De 阅读全文

posted @ 2017-08-04 23:29 见字如面 阅读(214) 评论(0) 推荐(0)

HDU 6069 Counting Divisors(2017 Multi-University Training Contest - Team 4 )
摘要:Output For each test case, print a single line containing an integer, denoting the answer. Sample Input 3 1 5 1 1 10 2 1 100 3 3 1 5 1 1 10 2 1 100 3 阅读全文

posted @ 2017-08-03 22:59 见字如面 阅读(219) 评论(0) 推荐(0)

2017 Multi-University Training Contest - Team 2 &&hdu 6050 Funny Function
摘要:Funny Function Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1109 Accepted Submission(s): 527 S 阅读全文

posted @ 2017-07-30 00:12 见字如面 阅读(174) 评论(0) 推荐(0)

HDU 4135 Co-prime
摘要:Co-prime Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N. Two integers are s 阅读全文

posted @ 2017-07-05 22:32 见字如面 阅读(224) 评论(0) 推荐(0)

CodeForces - 810C(规律)
摘要:C. Do you want a date? time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Leha decided to m 阅读全文

posted @ 2017-05-21 23:22 见字如面 阅读(475) 评论(0) 推荐(0)

UVA 10006(素数打表+快速幂)
摘要:当今计算机科学的一个重要的领域就是密码学。有些人甚至认为密码学是计算机科学中唯一重要的领域,没有密码学生命都没有意义。 阿尔瓦罗就是这样的一个人,它正在设计一个为西班牙杂烩菜饭加密的步骤。他在加密算法中应用了一些非常大的素数。然而确认一个非常大的数是不是素数并不是那么简单。一个费时的方法是用比这个数 阅读全文

posted @ 2017-02-16 14:18 见字如面 阅读(388) 评论(0) 推荐(0)

导航