摘要: 1011 World Cup Betting (20分) With the 2010 FIFA World Cup running, football fans the world over were becoming increasingly excited as the best players 阅读全文
posted @ 2020-08-21 21:51 houyz 阅读(137) 评论(0) 推荐(0)
摘要: 1010 Radix (25分) Given a pair of positive integers, for example, 6 and 110, can this equation 6 = 110 be true? The answer is yes, if 6 is a decimal nu 阅读全文
posted @ 2020-08-21 21:09 houyz 阅读(235) 评论(0) 推荐(0)
摘要: 1009 Product of Polynomials (25分) This time, you are supposed to find A×B where A and B are two polynomials. Input Specification: Each input file cont 阅读全文
posted @ 2020-08-21 10:29 houyz 阅读(89) 评论(0) 推荐(0)
摘要: 1008 Elevator (20分) The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at w 阅读全文
posted @ 2020-08-20 23:07 houyz 阅读(199) 评论(0) 推荐(0)
摘要: 1007 Maximum Subsequence Sum (25分) Given a sequence of K integers { N​1​​, N​2​​, ..., N​K​​ }. A continuous subsequence is defined to be { N​i​​, N​i 阅读全文
posted @ 2020-08-20 22:45 houyz 阅读(130) 评论(0) 推荐(0)
摘要: #include<iostream>#include <cstdio>#include <string.h> #include <math.h> using namespace std; int time_value(int h,int m,int s){ return h*3600+m*60+s; 阅读全文
posted @ 2020-08-19 23:23 houyz 阅读(108) 评论(0) 推荐(0)
摘要: #include<iostream> #include <cstdio> #include <string.h> #include <math.h> using namespace std; int main(){ char s[101]; cin>>s; //求和 int len = strlen 阅读全文
posted @ 2020-08-19 22:43 houyz 阅读(141) 评论(0) 推荐(0)
摘要: This time, you are supposed to find A+B where A and B are two polynomials. Input Specification: Each input file contains one test case. Each case occu 阅读全文
posted @ 2020-08-15 19:42 houyz 阅读(100) 评论(0) 推荐(0)
摘要: Sample Input: -1000000 9 Sample Output: -999,991 #include <iostream> #include <cstdio> #include <string.h> using namespace std; int main() { int a, b; 阅读全文
posted @ 2020-08-15 17:14 houyz 阅读(74) 评论(0) 推荐(0)
摘要: 算法,PAT,网页技术,php,C/C++ 阅读全文
posted @ 2020-08-15 09:58 houyz 阅读(123) 评论(1) 推荐(0)