摘要: http://lightoj.com/volume_showproblem.php?problem=1236Pairs Forming LCMTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitStatusPra... 阅读全文
posted @ 2015-11-04 18:55 午夜阳光~ 阅读(430) 评论(0) 推荐(0) 编辑
摘要: http://lightoj.com/volume_showproblem.php?problem=1245G -Harmonic Number (II)Time Limit:3000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitSta... 阅读全文
posted @ 2015-11-04 16:09 午夜阳光~ 阅读(405) 评论(0) 推荐(0) 编辑
摘要: http://lightoj.com/volume_showproblem.php?problem=1259题目大意:给你一个数n,这个数能分成两个素数a、b,n = a + b且a#include#include#include#includeusing namespace std;typedef... 阅读全文
posted @ 2015-11-04 09:59 午夜阳光~ 阅读(513) 评论(0) 推荐(0) 编辑