04 2016 档案

摘要:《数据结构》严蔚敏 头文件SQlist.h 函数实现 阅读全文
posted @ 2016-04-27 20:42 樱花落舞 阅读(321) 评论(0) 推荐(0) 编辑
摘要:《数据结构》严蔚敏 头文件Stacksq.h 函数实现 阅读全文
posted @ 2016-04-27 09:44 樱花落舞 阅读(407) 评论(0) 推荐(0) 编辑
摘要:第一题~这个就不用说了吧~拿计算器自己算一算,你就知道啦~ 第二题~要知道连续的数字公约数只有两个~要么就是它本身(a==b),要么就是1 第三题~n*n-n+2 要推导过程可以看一下《组合数学》 第四题,如果嫌那种跨月的计算麻烦的话,我们统一换成从1年1月1号计算,然后计算天数之差,大于等于7的统 阅读全文
posted @ 2016-04-25 19:37 樱花落舞 阅读(358) 评论(0) 推荐(0) 编辑
摘要:Description Greatest common divisor GCD(a, b) of two positive integers a and b is equal to the biggest integer d such that both integers a and b are d 阅读全文
posted @ 2016-04-17 22:21 樱花落舞 阅读(208) 评论(0) 推荐(0) 编辑
摘要:#include #include #include using namespace std; #define DIGIT 4 //四位隔开,即万进制 #define DEPTH 10000 //万进制 #define MAX 100 //题目最大位数/4,要不大直接设为最大位数也行 typedef int bignum_t[MAX+1]... 阅读全文
posted @ 2016-04-17 11:11 樱花落舞 阅读(260) 评论(0) 推荐(0) 编辑
摘要:Description Consider 2n rows of the seats in a bus. n rows of the seats on the left and n rows of the seats on the right. Each row can be filled by tw 阅读全文
posted @ 2016-04-11 22:17 樱花落舞 阅读(192) 评论(0) 推荐(0) 编辑
摘要:Description You are given an array of n elements, you must make it a co-prime array in as few moves as possible. In each move you can insert any posit 阅读全文
posted @ 2016-04-11 22:08 樱花落舞 阅读(214) 评论(0) 推荐(0) 编辑
摘要:Description Mike and some bears are playing a game just for fun. Mike is the judge. All bears except Mike are standing in an n × m grid, there's exact 阅读全文
posted @ 2016-04-11 21:54 樱花落舞 阅读(255) 评论(0) 推荐(0) 编辑
摘要:Description While Mike was walking in the subway, all the stuff in his back-bag dropped on the ground. There were several fax messages among them. He 阅读全文
posted @ 2016-04-09 10:54 樱花落舞 阅读(300) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示