上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 39 下一页
摘要: The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ... 阅读全文
posted @ 2015-08-02 21:09 Painting、时光 阅读(137) 评论(0) 推荐(0) 编辑
摘要: A lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to eliminate the battleships. Ea... 阅读全文
posted @ 2015-08-02 21:07 Painting、时光 阅读(173) 评论(0) 推荐(0) 编辑
摘要: There is an integeraandnintegersb1,…,bn. After selecting some numbers fromb1,…,bnin any order, sayc1,…,cr, we want to make sure thatamodc1modc2mod…mod... 阅读全文
posted @ 2015-08-02 15:27 Painting、时光 阅读(108) 评论(0) 推荐(0) 编辑
摘要: You have two friends. You want to present each of them several positive integers. You want to presentcnt1numbers to the first friend andcnt2numbers to... 阅读全文
posted @ 2015-08-02 15:01 Painting、时光 阅读(269) 评论(0) 推荐(0) 编辑
摘要: You haveNintegers,A1,A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a... 阅读全文
posted @ 2015-08-01 15:47 Painting、时光 阅读(166) 评论(0) 推荐(0) 编辑
摘要: At the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the place wher... 阅读全文
posted @ 2015-08-01 15:45 Painting、时光 阅读(133) 评论(0) 推荐(0) 编辑
摘要: Soda has a bipartite graph withnvertices andmundirected edges. Now he wants to make the graph become a complete bipartite graph with most edges by add... 阅读全文
posted @ 2015-08-01 15:39 Painting、时光 阅读(170) 评论(0) 推荐(0) 编辑
摘要: Mr. Hdu is interested in Greatest Common Divisor (GCD). He wants to find more and more interesting things about GCD. Today He comes up with Range Grea... 阅读全文
posted @ 2015-08-01 15:38 Painting、时光 阅读(203) 评论(0) 推荐(0) 编辑
摘要: Luke wants to upgrade his home computer network from 10mbs to 100mbs. His existing network uses 10base2 (coaxial) cables that allow you to connect any... 阅读全文
posted @ 2015-08-01 15:35 Painting、时光 阅读(231) 评论(0) 推荐(0) 编辑
摘要: There are N point on X-axis . Miaomiao would like to cover them ALL by using segments with same length.There are 2 limits:1.A point is convered if the... 阅读全文
posted @ 2015-08-01 15:34 Painting、时光 阅读(153) 评论(0) 推荐(0) 编辑
上一页 1 ··· 6 7 8 9 10 11 12 13 14 ··· 39 下一页