摘要： long long gcd(long long b,long long c)//计算最大公约数{ return c==0?b:gcd(c,b%c);} long long lcm(long long b,long long c)//计算最小公倍数{ return b * c/ gcd(b, c); 阅读全文

摘要： 题目传送：http://acm.hdu.edu.cn/diy/contest_showproblem.php?cid=20918&pid=1002 Problem Description Now you get a number N, and a M-integers set, you should 阅读全文