上一页 1 2 3 4 5 6 7 8 9 10 ··· 14 下一页
摘要: Consider a single-elimination football tournament involving 2n teams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tou 阅读全文
posted @ 2017-09-06 16:20 抓不住Jerry的Tom 阅读(198) 评论(0) 推荐(0) 编辑
摘要: Description You are in charge of setting up the press room for the inaugural meeting of the United Nations Internet eXecutive (UNIX), which has an int 阅读全文
posted @ 2017-09-03 09:48 抓不住Jerry的Tom 阅读(272) 评论(0) 推荐(0) 编辑
摘要: Problem Description 小白最近又被空军特招为飞行员,参与一项实战演习。演习的内容还是轰炸某个岛屿(这次的岛屿很大,很大很大很大,大到炸弹怎么扔都能完全在岛屿上引爆),看来小白确实是飞行员的命。。。这一次,小白扔的炸弹比较奇怪,爆炸的覆盖区域不是圆形,而是一个不规则的简单多边形,请你 阅读全文
posted @ 2017-09-02 09:58 抓不住Jerry的Tom 阅读(244) 评论(0) 推荐(0) 编辑
摘要: Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means that the clover is covered by wa 阅读全文
posted @ 2017-08-29 22:15 抓不住Jerry的Tom 阅读(135) 评论(0) 推荐(0) 编辑
摘要: Description You are given N sets, the i-th set (represent by S(i)) have C(i) element (Here "set" isn't entirely the same as the "set" defined in mathe 阅读全文
posted @ 2017-08-22 10:53 抓不住Jerry的Tom 阅读(249) 评论(0) 推荐(0) 编辑
摘要: Consider a N*N*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0,0) ? A 阅读全文
posted @ 2017-08-22 01:49 抓不住Jerry的Tom 阅读(402) 评论(0) 推荐(0) 编辑
摘要: Problem Description As an eligible Ingress Resistance Agent you should know your power source, the Exotic Matter.We call it XM, which is the driving f 阅读全文
posted @ 2017-08-22 01:02 抓不住Jerry的Tom 阅读(607) 评论(0) 推荐(0) 编辑
摘要: Problem Description 众所周知,度度熊非常喜欢数字。它最近发明了一种新的数字:Valley Number,像山谷一样的数字。当一个数字,从左到右依次看过去数字没有出现先递增接着递减的“山峰”现象,就被称作 Valley Number。它可以递增,也可以递减,还可以先递减再递增。在递 阅读全文
posted @ 2017-08-18 22:32 抓不住Jerry的Tom 阅读(659) 评论(0) 推荐(0) 编辑
摘要: Problem Description > The Death Star, known officially as the DS-1 Orbital Battle Station, also known as the Death Star I, the First Death Star, Proje 阅读全文
posted @ 2017-08-18 13:14 抓不住Jerry的Tom 阅读(244) 评论(0) 推荐(0) 编辑
摘要: Problem Description We define the distance of two strings A and B with same length n isdisA,B=∑(i=0 n−1) |A[i]−B[n−1−i]|The difference between the two 阅读全文
posted @ 2017-08-11 11:01 抓不住Jerry的Tom 阅读(229) 评论(0) 推荐(0) 编辑
上一页 1 2 3 4 5 6 7 8 9 10 ··· 14 下一页