随笔分类 -  数论

上一页 1 2
LightOJ 1341(Aladdin and the Flying Carpet )算术基本定理
摘要：It's said that Aladdin had to solve seven mysteries before getting the Magical Lamp which summons a powerful Genie. Here we are concerned about the fi 阅读全文
posted @ 2018-03-19 22:51 ACRykl 阅读(180) 评论(0) 推荐(0)
LightOJ 1245(Harmonic Number (II))
摘要：I was trying to solve problem '1234 - Harmonic Number', I wrote the following code long long H( int n ) { long long res = 0; for( int i = 1; i <= n; i 阅读全文
posted @ 2018-03-18 22:52 ACRykl 阅读(332) 评论(0) 推荐(0)
LightOJ1234(Harmonic Number)
摘要：Harmonic Number In mathematics, the nth harmonic number is the sum of the reciprocals of the first n natural numbers: In this problem, you are given n 阅读全文
posted @ 2018-03-16 22:13 ACRykl 阅读(132) 评论(0) 推荐(0)
LightOJ1282( Leading and Trailing )
摘要：Leading and Trailing You are given two integers: n and k, your task is to find the most significant three digits, and least significant three digits o 阅读全文
posted @ 2018-03-15 21:34 ACRykl 阅读(153) 评论(0) 推荐(0)
hdu1397(Goldbach`s Conjecture )
摘要：Goldbach's Conjecture Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7550 Accepted Submission(s) 阅读全文
posted @ 2018-03-15 20:21 ACRykl 阅读(169) 评论(0) 推荐(0)
poj1061(扩展欧几里得)
摘要：青蛙的约会 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 123444 Accepted: 26326 Description 两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上 阅读全文
posted @ 2018-03-15 19:54 ACRykl 阅读(83) 评论(0) 推荐(0)
LightOJ1007(欧拉函数)
摘要：Mathematically Hard Mathematically some problems look hard. But with the help of the computer, some problems can be easily solvable. In this problem, 阅读全文
posted @ 2018-03-14 17:25 ACRykl 阅读(113) 评论(0) 推荐(0)
LightOJ1370(欧拉函数)
摘要：Bi-shoe and Phi-shoe Bamboo Pole-vault is a massively popular sport in Xzhiland. And Master Phi-shoe is a very popular coach for his success. He needs 阅读全文
posted @ 2018-03-14 17:22 ACRykl 阅读(147) 评论(0) 推荐(0)

上一页 1 2