STL
文章平均质量分 84
GKHack
这个作者很懒,什么都没留下…
展开
-
Testing Round #12 597ABC题解
题目链接: 点击打开链接A: 给出k, a, b. 问你在[a, b]区间内有多少可以整除k的数.脑洞题目, 计算此区间长度可以存放k的个数即可.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;typedef lon原创 2015-11-15 09:19:58 · 876 阅读 · 0 评论 -
Manthan, Codefest 16 633D Fibonacci-ish(脑洞+stl)
D. Fibonacci-ishtime limit per test3 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputYash has recently learnt about the Fibonac原创 2016-02-28 09:11:48 · 828 阅读 · 0 评论 -
Manthan, Codefest 16 633C Spy Syndrome 2(dfs + stl)
C. Spy Syndrome 2time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAfter observing the results of Spy Syndro原创 2016-02-28 08:27:26 · 1342 阅读 · 0 评论 -
UVALive 7512 November 11th(脑洞)
题目链接:点击打开链接给出坏凳子的位置, 座位不能挨着坐, 问最多可以做多少人, 以及最少可以坐多少人使得不能再有可以坐的位置.最多可以坐多少人, 只要中间空一个即可, 本题wa点在最少坐的人数, 中间空两个也可以... 比如.S..S.所以空的位置大于2时, 分母为3.AC代码:#include "iostream"#include "cstdio"#include "cst原创 2016-03-29 17:04:08 · 836 阅读 · 0 评论 -
Codeforces Round #344 (Div. 2) 631C Report(脑洞+stl)
C. Reporttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach month Blake gets the report containing main原创 2016-03-04 16:51:06 · 1012 阅读 · 2 评论 -
UVALive 7410 Kingdom of Black and White(脑洞 + stl)
题目链接:点击打开链接给出一个由01构成字符串, 可以修改字符一次, 问连续的0或1最大的平方和是多少.题目即求最长的0串或者1串, 先求出给出字符串的平方和, 遍历一次, 分两种情况, 一种是当前为1, 一种是一般情况. 当前为1时, 要判断前一段与后一段和是否大于最大. 求出最多增长加到ans即可.AC代码:#include "iostream"#include "cst原创 2016-03-29 16:54:57 · 503 阅读 · 0 评论 -
Educational Codeforces Round 4 612D The Union of k-Segments(stl)
D. The Union of k-Segmentstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given n segments on the原创 2016-02-14 09:10:48 · 633 阅读 · 0 评论 -
Wunder Fund Round 2016 (Div. 1 + Div. 2 combined) 618C Constellation(计算几何+stl)
C. Constellationtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputCat Noku has obtained a map of the night s原创 2016-01-31 17:17:17 · 659 阅读 · 0 评论 -
Codeforces Round #342 (Div. 2) 625B War of the Corporations(stl)
B. War of the Corporationstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA long time ago, in a galaxy far原创 2016-02-13 10:25:58 · 673 阅读 · 0 评论 -
BestCoder Round #69 (div.2) B HDOJ5611 Baby Ming and phone number(stl)
Baby Ming and phone numberTime Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 373 Accepted Submission(s): 108Problem DescriptionB原创 2016-01-24 01:23:47 · 574 阅读 · 0 评论 -
Codeforces Round #335 (Div. 2) 606D Lazy Student(最小生成树+stl)
D. Lazy Studenttime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Vladislav came to his programming e原创 2016-01-23 17:21:09 · 794 阅读 · 0 评论 -
Educational Codeforces Round 6 620C Pearls in a Row(stl)
C. Pearls in a Rowtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThere are n pearls in a row. Let's enume原创 2016-01-22 01:34:01 · 957 阅读 · 0 评论 -
Codeforces Round #331 (Div. 2) 596ABC题解
题目链接: 点击打开链接A: 给出n个点的坐标, 问你这n个点能不能确定一个矩形, 如果可以求出面积, 不可以则输出-1.脑洞题, n为1输出-1, 其他情况则求面积, 若面积为0则不能确定, 注意数据初始化, 为此wa了一发.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "原创 2015-11-17 08:37:35 · 1312 阅读 · 0 评论 -
Codeforces Round #332 (Div. 2) 599B Spongebob and Joke(STL)
B. Spongebob and Joketime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputWhile Patrick was gone shopping, Spon原创 2015-11-23 10:38:52 · 1027 阅读 · 0 评论 -
Codeforces Round #332 (Div. 2) 599C Day at the Beach(脑洞)
C. Day at the Beachtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne day Squidward, Spongebob and Patric原创 2015-11-23 11:02:07 · 1315 阅读 · 0 评论 -
BestCoder Round #58 (div.2) HDOJ5494 5495 5496 5497题解
题目连接: 点击打开链接A: 模拟题, 从小到大排序后求a的前m个和与b的后m个和作比较即可.AC代码:#include "iostream"#include "cstdio"#include "cstring"#include "algorithm"using namespace std;const int MAXN = 505;int n, m, a[MAXN]原创 2015-11-15 13:09:28 · 1054 阅读 · 0 评论 -
IndiaHacks 2016 - Online Edition (Div. 1 + Div. 2) 653B Bear and Compressing(dfs + stl)
B. Bear and Compressingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLimak is a little polar bear. Polar原创 2016-03-25 11:11:48 · 771 阅读 · 1 评论