02 2014 档案

NYOJ 939最小公倍数
摘要：/*** 求LCM(1,2,3,...n)**/#include #include #include using namespace std;#define N 100000010unsigned int prime[6000000], p[6000000], T, num;unsigned ... 阅读全文
posted @ 2014-02-27 20:17 YaLing 阅读(232) 评论(0) 推荐(0)