蓝色记忆2013

摘要： G - Zombie’s Treasure ChestCrawling in process... Crawling failed Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u DescriptionSome brave warriors come to a lost village. They are very lucky and find a lot of treasures and a big treasure chest, but with angry zombies. The warr 阅读全文

摘要： #includeusing namespace std;long long GCD(long long a,long long b)//求最大公约数的方法 { long long t; if(a<b) {t=a;a=b;b=t;} if(a%b==0) return b; else return GCD(b,a%b);}long long LCM(long long a,long long b)//求最小公倍数的方法 { return a/GCD(a,b)*b; }int main(){ cout<<GCD(8,28)<<endl; cout<... 阅读全文