Tob__yuhong

NOJ 爱过

摘要：题目描述：模拟一个对话场景，请找出一个连续字符串中分别出现了多少个“ask”和“asked”，每遇到一个单独的ask输出一行love，每遇到一个asked输出一行loved（遇到asked中包含的ask时不输出love）输入：第一行为一个整数T，表示数据组数；每组数据输入为一个长度不超过2000的字... 阅读全文

posted @ 2015-04-20 16:49 Tob__yuhong 阅读(95) 评论(0) 推荐(0) 编辑

Greatest Greatest Common Divisor HD5207

摘要： Greatest Greatest Common DivisorAccepts: 271Submissions: 1138Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem De... 阅读全文

posted @ 2015-04-19 00:02 Tob__yuhong 阅读(154) 评论(0) 推荐(0) 编辑

Greatest Greatest Common Divisor HD5207

摘要： Greatest Greatest Common DivisorAccepts: 271Submissions: 1138Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem De... 阅读全文

posted @ 2015-04-19 00:02 Tob__yuhong 阅读(115) 评论(0) 推荐(0) 编辑

Greatest Greatest Common Divisor HD5207

摘要： Greatest Greatest Common DivisorAccepts: 271Submissions: 1138Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem De... 阅读全文

posted @ 2015-04-19 00:02 Tob__yuhong 阅读(144) 评论(0) 推荐(0) 编辑

Greatest Greatest Common Divisor HD5207

摘要： Greatest Greatest Common DivisorAccepts: 271Submissions: 1138Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem De... 阅读全文

posted @ 2015-04-19 00:02 Tob__yuhong 阅读(188) 评论(0) 推荐(0) 编辑

Four Inages Strateg

摘要： Four Inages StrategyAccepts: 186Submissions: 1374Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionYou... 阅读全文

posted @ 2015-04-18 21:09 Tob__yuhong 阅读(136) 评论(0) 推荐(0) 编辑

Four Inages Strateg

摘要： Four Inages StrategyAccepts: 186Submissions: 1374Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionYou... 阅读全文

posted @ 2015-04-18 21:09 Tob__yuhong 阅读(129) 评论(0) 推荐(0) 编辑

Four Inages Strateg

摘要： Four Inages StrategyAccepts: 186Submissions: 1374Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionYou... 阅读全文

posted @ 2015-04-18 21:09 Tob__yuhong 阅读(127) 评论(0) 推荐(0) 编辑

Four Inages Strateg

摘要： Four Inages StrategyAccepts: 186Submissions: 1374Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Problem DescriptionYou... 阅读全文

posted @ 2015-04-18 21:09 Tob__yuhong 阅读(141) 评论(0) 推荐(0) 编辑

模运算 NOJ 1037

摘要：模运算时间限制(普通/Java):1000 MS/3000 MS 运行内存限制 : 65536 KByte总提交 : 1026 测试通过 : 191题目描述给定整数a,b,n,要求计算(a^b)mod n输... 阅读全文

posted @ 2015-04-16 14:31 Tob__yuhong 阅读(197) 评论(0) 推荐(0) 编辑

NOJ 爱过

Greatest Greatest Common Divisor HD5207

Greatest Greatest Common Divisor HD5207

Greatest Greatest Common Divisor HD5207

Greatest Greatest Common Divisor HD5207

Four Inages Strateg

Four Inages Strateg

Four Inages Strateg

Four Inages Strateg

模运算 NOJ 1037

导航

公告