不要过于沉溺过去，也不要过于畅想未来，把握现在！

随笔分类 -  数论

POJ 2603
摘要：Brave balloonistsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4934Accepted: 2074DescriptionTen mathematicians are flying on a balloon over... 阅读全文
posted @ 2015-03-10 21:38 coding_yuan 阅读(268) 评论(0) 推荐(0)
Java常用类库--大数处理类--BigInteger
摘要：转自大神博客：点击打开链接Java常用类库--大数处理类--BigInteger(2011-10-13 19:53:18)转载▼标签：java常用类库--大数处理类biginteger杂谈分类：JavaJava常用类库--大数处理类·操作整型：BigInteger类·操作小数：BigDecimal类... 阅读全文
posted @ 2014-09-27 15:08 coding_yuan 阅读(256) 评论(0) 推荐(0)
POJ 2769 Reduced ID Numbers
摘要：思路： 枚举Reduced ID NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 8847 Accepted: 3552DescriptionT. Chur teaches various groups of stud... 阅读全文
posted @ 2014-08-21 14:44 coding_yuan 阅读(140) 评论(0) 推荐(0)
LightOj 1179 Josephus Problem
摘要：1179 - Josephus ProblemPDF (English) Statistics ForumTime Limit: 2 second(s) Memory Limit: 32 MBThe historian Flavius Josephus relates how, in the Rom... 阅读全文
posted @ 2014-08-21 13:33 coding_yuan 阅读(262) 评论(0) 推荐(0)
LightOj 1148 Basic Math
摘要：1148 - Mad CountingPDF (English) Statistics ForumTime Limit: 0.5 second(s) Memory Limit: 32 MBMob was hijacked by the mayor of the Town "TruthTown". M... 阅读全文
posted @ 2014-08-21 10:24 coding_yuan 阅读(170) 评论(0) 推荐(0)
LightOj 1078 Basic Math
摘要：思路： 设输入的两个数分别为n和a,每一次所得到的数为update： 开始update=a,依次update分别为update*10+a,这样数据会超出范围，则update每次为update=(update*10+a)%n即可， 如果update=0,跳出循环； 只需证明：(update*10+a)... 阅读全文
posted @ 2014-08-21 00:35 coding_yuan 阅读(232) 评论(0) 推荐(0)
Light Oj 1214 大数整除
摘要：Large DivisionTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1214DescriptionGiven two integers, a and b... 阅读全文
posted @ 2014-08-07 16:14 coding_yuan 阅读(262) 评论(0) 推荐(0)
Light Oj 1116
摘要：Ekka DokkaTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionEkka and his friend Dokka decided to buy a cake. Th... 阅读全文
posted @ 2014-08-07 01:12 coding_yuan 阅读(198) 评论(0) 推荐(0)
阶乘位数转化
摘要：Digits of FactorialTime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionFactorial of an integer is defined by the ... 阅读全文
posted @ 2014-08-05 21:56 coding_yuan 阅读(273) 评论(0) 推荐(0)
Light Oj 1008
摘要：Fibsieve`s Fantabulous BirthdayTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluSubmitStatusDescriptionFibsieve had a fantabulous (yes... 阅读全文
posted @ 2014-08-05 19:20 coding_yuan 阅读(225) 评论(0) 推荐(0)
分拆素数和 埃氏筛法
摘要：分拆素数和Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusPracticeHDU 2098Description把一个偶数拆成两个不同素数的和，有几种拆法呢？Input输入包含一些正的偶数... 阅读全文
posted @ 2014-07-31 23:37 coding_yuan 阅读(370) 评论(0) 推荐(0)
快速幂
摘要：快速幂Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmitStatusDescriptionGiven a positive integer N, you should output the most r... 阅读全文
posted @ 2014-07-28 14:16 coding_yuan 阅读(188) 评论(0) 推荐(0)

不要过于沉溺过去，也不要过于畅想未来，把握现在！