上一页 1 ··· 35 36 37 38 39 40 41 42 43 ··· 57 下一页
摘要: Description Santa Claus decided to disassemble his keyboard to clean it. After he returned all the keys back, he suddenly realized that some pairs of 阅读全文
posted @ 2016-12-25 23:02 樱花落舞 阅读(237) 评论(0) 推荐(0) 编辑
摘要: Description Santa Claus is the first who came to the Christmas Olympiad, and he is going to be the first to take his place at a desk! In the classroom 阅读全文
posted @ 2016-12-25 22:55 樱花落舞 阅读(339) 评论(0) 推荐(0) 编辑
摘要: 反差萌 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0 Problem Descripti 阅读全文
posted @ 2016-12-24 17:20 樱花落舞 阅读(400) 评论(0) 推荐(0) 编辑
摘要: 我要拿走你的蜡烛 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0 Problem Desc 阅读全文
posted @ 2016-12-24 17:17 樱花落舞 阅读(327) 评论(0) 推荐(0) 编辑
摘要: 洗衣服 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0 Problem Descripti 阅读全文
posted @ 2016-12-24 17:14 樱花落舞 阅读(420) 评论(0) 推荐(0) 编辑
摘要: 递增数 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0 Problem Descripti 阅读全文
posted @ 2016-12-24 17:10 樱花落舞 阅读(364) 评论(0) 推荐(0) 编辑
摘要: BigZhuGod的粉丝 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0 Problem 阅读全文
posted @ 2016-12-24 17:06 樱花落舞 阅读(363) 评论(0) 推荐(0) 编辑
摘要: A - Addition and Subtraction Easy Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement Joisino wants to evaluate the formula 阅读全文
posted @ 2016-12-19 00:21 樱花落舞 阅读(956) 评论(0) 推荐(0) 编辑
摘要: 排版都乱了,直接看链接吧:http://202.197.224.59/OnlineJudge2/index.php/Contest/problems/contest_id/42 排版都乱了,直接看链接吧:http://202.197.224.59/OnlineJudge2/index.php/Con 阅读全文
posted @ 2016-12-18 19:11 樱花落舞 阅读(444) 评论(0) 推荐(0) 编辑
摘要: Problem Description halfyarn找你写个简单的题?好哒!给你n个整数,现在要求你选择两个位置的数,例如选择第pos_a个数a,和第pos_b个数b,给定ans=min(a,b)*abs(pos_a-pos_b),输出ans的最大值。 Input 第一行输入一个n代表有n个数, 阅读全文
posted @ 2016-12-04 21:28 樱花落舞 阅读(383) 评论(0) 推荐(0) 编辑
上一页 1 ··· 35 36 37 38 39 40 41 42 43 ··· 57 下一页