上一页 1 ··· 5 6 7 8 9 10 11 12 13 14 下一页
摘要: Problem Description:Now,given the equation 8*x^4 + 7*x^3 + 2*x^2 + 3*x + 6 == Y,can you find its solution between 0 and 100;Now please try your lucky.... 阅读全文
posted @ 2015-09-03 22:50 搁浅の记忆 阅读(197) 评论(1) 推荐(0) 编辑
摘要: Problem Description:都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。馅饼如果掉在了地上当然就不能吃了,所以gameboy马上卸下身上的背包去接。但由于小... 阅读全文
posted @ 2015-09-03 10:46 搁浅の记忆 阅读(202) 评论(0) 推荐(0) 编辑
摘要: Problem Description:Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 const int N=1000010;int a[N], b[10010... 阅读全文
posted @ 2015-09-01 13:00 搁浅の记忆 阅读(138) 评论(0) 推荐(0) 编辑
摘要: Problem Description:Given a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or grea... 阅读全文
posted @ 2015-08-21 09:41 搁浅の记忆 阅读(144) 评论(0) 推荐(0) 编辑
摘要: Description:You task is to find minimal natural numberN, so thatN!contains exactlyQzeroes on the trail in decimal notation. As you knowN! = 1*2*...*N.... 阅读全文
posted @ 2015-08-20 20:30 搁浅の记忆 阅读(305) 评论(0) 推荐(1) 编辑
摘要: Painting some colored segments on a line, some previously painted segments may be covered by some the subsequent ones.Your task is counting the segmen... 阅读全文
posted @ 2015-08-19 21:26 搁浅の记忆 阅读(125) 评论(0) 推荐(0) 编辑
摘要: Description:In order to get from one of the F (1 2 and 1 –> 6 –> 5 –> 21 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 43 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5... 阅读全文
posted @ 2015-08-19 10:23 搁浅の记忆 阅读(163) 评论(0) 推荐(0) 编辑
摘要: Description:BIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarc... 阅读全文
posted @ 2015-08-18 16:48 搁浅の记忆 阅读(129) 评论(0) 推荐(0) 编辑
摘要: Description:Given a tree (a connected graph with no cycles), you have to find the farthest nodes in the tree. The edges of the tree are weighted and u... 阅读全文
posted @ 2015-08-18 14:46 搁浅の记忆 阅读(134) 评论(0) 推荐(0) 编辑
摘要: Description:Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t... 阅读全文
posted @ 2015-08-18 09:44 搁浅の记忆 阅读(215) 评论(0) 推荐(0) 编辑
上一页 1 ··· 5 6 7 8 9 10 11 12 13 14 下一页