上一页 1 ··· 3 4 5 6 7 8 下一页
摘要: A+B for Input-Output Practice (VIII) Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 55289 Accepted Submission(s): 16787 Problem Description ... 阅读全文
posted @ 2012-07-21 13:03 赵杰迪! 阅读(149) 评论(0) 推荐(0) 编辑
摘要: 最小公倍数 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20327 Accepted Submission(s): 11001 Problem Description 给定两个正整数,计算这两个数的最小公倍数。 Input... 阅读全文
posted @ 2012-07-21 12:57 赵杰迪! 阅读(108) 评论(0) 推荐(0) 编辑
摘要: Elevator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24439 Accepted Submission(s): 13116 Problem Description The highest building in our ... 阅读全文
posted @ 2012-07-21 12:54 赵杰迪! 阅读(97) 评论(0) 推荐(0) 编辑
摘要: A hard puzzle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18634 Accepted Submission(s): 6631 Problem Description lcy gives a hard puzzle ... 阅读全文
posted @ 2012-07-21 12:51 赵杰迪! 阅读(105) 评论(0) 推荐(0) 编辑
摘要: Big Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15789 Accepted Submission(s): 6977 Problem Description In many applications very l... 阅读全文
posted @ 2012-07-21 12:47 赵杰迪! 阅读(108) 评论(0) 推荐(0) 编辑
摘要: View Code #include int gcd(int a,int b) { int t,aa=a,bb=b; if(a<b) {t=a;a=b;b=t;} while(b) {t=a%b;a=b;b=t;} //printf("%d\n",(int)((double)aa/a*bb));// return (int)((doubl... 阅读全文
posted @ 2012-07-21 12:44 赵杰迪! 阅读(139) 评论(0) 推荐(0) 编辑
摘要: Fibonacci Again Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21014 Accepted Submission(s): 10045 Problem Description There are another kin... 阅读全文
posted @ 2012-07-21 12:33 赵杰迪! 阅读(115) 评论(0) 推荐(0) 编辑
摘要: Binary String Matching 时间限制:3000 ms | 内存限制:65535 KB 难度:3 描述Given two strings A and B, whose alphabet consist only ‘0’ and ‘1’. Your task is only to tell how many times does A appear as a substri... 阅读全文
posted @ 2012-07-21 02:13 赵杰迪! 阅读(97) 评论(0) 推荐(0) 编辑
摘要: 比大小 时间限制:3000 ms | 内存限制:65535 KB 难度:2 描述 给你两个很大的数,你能不能判断出他们两个数的大小呢? 比如123456789123456789要大于-123456 输入每组测试数据占一行,输入两个不超过1000位的10进制整数a,b数据保证输入的a,b没有前缀的0。如果输入0 0表示输入结束。测试数据组数不超过10组输出如果a>b则输出“a>b”... 阅读全文
posted @ 2012-07-21 02:10 赵杰迪! 阅读(145) 评论(0) 推荐(0) 编辑
摘要: 骨牌铺方格 时间限制:1000 ms | 内存限制:65535 KB 难度:2 描述在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数.例如n=3时,为2× 3方格,骨牌的铺放方案有三种,如下图: 输入输入数据由多行组成,每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n (0 int main() { int n,i; lo... 阅读全文
posted @ 2012-07-21 02:07 赵杰迪! 阅读(98) 评论(0) 推荐(0) 编辑
上一页 1 ··· 3 4 5 6 7 8 下一页