上一页 1 ··· 6 7 8 9 10 11 12 下一页
摘要: DescriptionBessie wants to navigate her spaceship through a dangerous asteroid field in the shape of an N x N grid (1 #include int n, k, link[510];boo... 阅读全文
posted @ 2013-08-06 09:27 Anti-Magic 阅读(165) 评论(0) 推荐(0) 编辑
摘要: Children of the Candy CornTime Limit:1000MSMemory Limit:65536KTotal Submissions:8102Accepted:3540DescriptionThe cornfield maze is a popular Halloween ... 阅读全文
posted @ 2013-08-03 15:09 Anti-Magic 阅读(245) 评论(3) 推荐(0) 编辑
摘要: Finding NemoTime Limit:2000MSMemory Limit:30000KTotal Submissions:6952Accepted:1584DescriptionNemo is a naughty boy. One day he went into the deep sea... 阅读全文
posted @ 2013-08-02 15:55 Anti-Magic 阅读(223) 评论(0) 推荐(0) 编辑
摘要: DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a str... 阅读全文
posted @ 2013-08-02 08:54 Anti-Magic 阅读(232) 评论(0) 推荐(0) 编辑
摘要: DescriptionSally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit even th... 阅读全文
posted @ 2013-08-01 17:27 Anti-Magic 阅读(224) 评论(0) 推荐(0) 编辑
摘要: The Pilots Brothers' refrigeratorTime Limit:1000MSMemory Limit:65536KTotal Submissions:15176Accepted:5672Special JudgeDescriptionThe game “The Pilots ... 阅读全文
posted @ 2013-06-22 16:36 Anti-Magic 阅读(209) 评论(0) 推荐(0) 编辑
摘要: 用的广播IP,所以校内网不用设置,直接在校内网随便找台电脑打开服务端,然后再随便找台电脑打开客户端,然后就可以做100以内的加法了。。。说明:客户端输入“ready”,服务端会随机发送一条加法算式,客户端发送结果,如果回答正确就显示“Right!”,然后可以输入“ready”做下一道题,否则显示“W... 阅读全文
posted @ 2013-06-19 13:49 Anti-Magic 阅读(389) 评论(0) 推荐(0) 编辑
摘要: Flip GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:24474Accepted:10517DescriptionFlip game is played on a rectangular 4x4 field with two-s... 阅读全文
posted @ 2013-06-19 10:43 Anti-Magic 阅读(188) 评论(0) 推荐(0) 编辑
摘要: 在客户端所在的目录新建一个IP.bwj的文件,写上服务端的IP,不要带空格,保存。双方都打开一个客户端和一个服务端就可以聊天了,(可以写自己的IP,自己跟自己聊。。)没有第三方服务器,服务端所在的电脑就是服务器。程序通过AF_INET协议族,监听7464端口,没写任何错误处理,这样便于突出主要矛盾嘛... 阅读全文
posted @ 2013-06-17 20:16 Anti-Magic 阅读(2293) 评论(2) 推荐(0) 编辑
摘要: 题意: 给出一个非降序排列的整数数组a[1], a[2], ...... , a[n],给出一系列询问(i, j),回答a[i], a[i+1], ...... , a[j]中出现最多的值所出现的次数。分析: 将数组游程编码,value[i]和cnt[i]分别表示第i段的数值和出现次数,num[... 阅读全文
posted @ 2013-05-31 21:37 Anti-Magic 阅读(324) 评论(0) 推荐(0) 编辑
上一页 1 ··· 6 7 8 9 10 11 12 下一页