摘要:
转自:http://hi.baidu.com/_green_hand_/item/721b7c8e5d8c63c8ee083df4欧几里德辗转相除法是最大公约数(greatest common divisor)的求法。C++代码如下: int gcd(int a, int b) { if(b == ... 阅读全文
摘要:
ConscriptionTime Limit:1000MSMemory Limit:65536KTotal Submissions:8243Accepted:2859DescriptionWindy has a country, and he wants to build an army to pr... 阅读全文
摘要:
RoadblocksTime Limit:2000MSMemory Limit:65536KTotal Submissions:7921Accepted:2896DescriptionBessie has moved to a small farm and sometimes enjoys retu... 阅读全文