玲珑学院OJ
夜幕下的ACM之路
通往成功的路注定是孤独的,我不会放弃!!!!
展开
-
玲珑学院OJ 1010 - Alarm(找规律+打表)
题目链接:http://www.ifrog.cc/acm/problem/10101010 - Alarm Time Limit:1s Memory Limit:128MByteSubmissions:347Solved:116DESCRIPTION Given a number sequence [ 3 , 7 , 22 , 45 , 116 , . . . ]原创 2016-09-25 21:09:31 · 555 阅读 · 0 评论 -
玲珑学院OJ 1000 - Spoon Devil's 3-D Matrix(3维最小生成树)
题目链接:http://www.ifrog.cc/acm/problem/1000 1000 - Spoon Devil’s 3-D Matrix Time Limit:1s Memory Limit:32MByteSubmissions:151Solved:53DESCRIPTION Spoon Devil build a 3-D matrix, and he(or she) wants t原创 2016-09-25 21:47:14 · 547 阅读 · 0 评论 -
玲珑学院OJ 1005 - Spoon Devil's RP Test(求余问题)
题目链接:http://www.ifrog.cc/acm/problem/10051005 - Spoon Devil’s RP Test Time Limit:1s Memory Limit:32MByteSubmissions:83Solved:49DESCRIPTION Spoon Devil finds a way to test one person’s RP: He defines原创 2016-09-29 12:50:39 · 454 阅读 · 0 评论 -
玲珑学院OJ 1014 - Absolute Defeat(智商暴力题)
题目链接:http://www.ifrog.cc/acm/problem/1014【题目分析】:给你一个长度为n的序列,每次你只能选择连续的k个数字加1,问你要进行多少次操作才能使所有的a[i]都大于m。 【思路】直接找每个数,看他是否大于m,不大于的话给从它开始的k个数,每个数都加上m-a[i]。下面是AC代码:#include<cstdio>#include<cstring>#includ原创 2016-09-29 13:30:33 · 661 阅读 · 0 评论