码迷,mamicode.com
首页 >  
搜索关键字:ignatius and the pri    ( 1549个结果
HDUJ 1098 Ignatius's puzzle
Ignatius's puzzle Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 6222    Accepted Submission(s): 4283 Problem Description Ignatius is ...
分类:其他好文   时间:2014-07-27 11:28:42    阅读次数:185
HDU 1253:胜利大逃亡(简单三维BFS)
胜利大逃亡 Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24937    Accepted Submission(s): 9535 Problem Description Ignatius被魔王抓走了,有一天魔...
分类:其他好文   时间:2014-07-26 15:17:10    阅读次数:305
HDU1028 Ignatius and the Princess III 【母函数模板题】
Ignatius and the Princess III Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 12521    Accepted Submission(s): 8838 Problem Descript...
分类:其他好文   时间:2014-07-26 02:21:36    阅读次数:214
boost thread
#include #include #include #include #include #include using namespace std;using namespace boost;void double_int(int & i){ i *= 2;}mutex io_mu;void pri...
分类:其他好文   时间:2014-07-26 00:59:46    阅读次数:253
1123: 统计难题 (字典树)
1123: 统计难题 时间限制: 1 Sec  内存限制: 128 MB 提交: 4  解决: 4 [提交][状态][讨论版] 题目描述 Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). 输入 输入数据的第一部分是一张单词表,每行一个单...
分类:其他好文   时间:2014-07-24 10:23:14    阅读次数:184
hdu1251统计难题(字典树)
Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只有小写字母组成,不会有重复的单词出现),现在老师要他统计出以某个字符串为前缀的单词数量(单词本身也是自己的前缀). Input 输入数据的第一部分是一张单词表,每行一个单词,单词的长度不超过10,它们代表的是老师交给Ignatius统计的单词,一个空行代表单词表的结束.第二部分是一连串...
分类:其他好文   时间:2014-07-23 22:34:37    阅读次数:296
hdu1075What Are You Talking About (字典树)
Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book of Mars and a dictionary when it leave...
分类:其他好文   时间:2014-07-23 22:33:38    阅读次数:281
HDU1071 The area 【积分】
The area Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 7476    Accepted Submission(s): 5222 Problem Description Ignatius bought a...
分类:其他好文   时间:2014-07-23 13:07:36    阅读次数:224
NOIP2010 题解
机器翻译 题解:模拟 1 #include 2 #include 3 4 const int MAXN = 1000; 5 6 int n, m, cj, now, MinV, MinId, Pri, a[MAXN+10], in[MAXN+10]; 7 8 int main(){ 9 ...
分类:其他好文   时间:2014-07-22 22:40:55    阅读次数:185
HDU1026 Ignatius and the Princess I 【BFS】+【路径记录】
Ignatius and the Princess I Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11710    Accepted Submission(s): 3661 Special Judge Problem...
分类:其他好文   时间:2014-07-22 18:00:03    阅读次数:283
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!