hpuw1234的博客

点击打开链接最小公倍数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 57536    Accepted Submission(s): 31980Problem Description给定两个正整数，计算这两

求最大公约数：1.迭代实现int gcd(int a,intb){ while(b!=0) { int r=b; b=a%b; a=r; } return a;}2.递归实现int gcd(int a,int b){ if(b==0) return a; ret

http://acm.hdu.edu.cn/showproblem.php?pid=1222                                              Wolf and RabbitTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

点击打开链接又见GCDTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19990    Accepted Submission(s): 8355Problem Description有三个正整数a,b,c(0

点击打开链接CakeTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4994    Accepted Submission(s): 2495Problem Description一次生日Party可能有p人或