- 博客(16)
- 收藏
- 关注
原创 C. League of Leesins
题解:这道题挺有意思的,主要是不停地把队尾元素一个个删除,然后再输出,这样就可以保证顺序不出错。代码:#include<bits/stdc++.h>using namespace std;typedef long long ll;const ll maxn=1e5+20;set<ll> pos[maxn],two,one;ll q[maxn][3];int ...
2019-11-22 16:44:00 449
原创 D. Shichikuji and Power Grid
codeforce链接昨天看到这道图论题感觉挺有意思的,记录下来。代码:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<cstring>#include<map&g...
2019-11-02 14:47:14 149
原创 Codeforces Round #587 (Div. 3)
链接:http://codeforces.com/contest/1216A. Prefixes代码:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<cstring>#i...
2019-09-22 10:17:45 204
原创 Educational Codeforces Round 73 (Rated for Div. 2)
链接:http://codeforces.com/contest/1221A. 2048 Game代码:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<cstring>#...
2019-09-21 13:23:47 109
原创 Codeforces Round #583 (Div. 1 + Div. 2, based on Olympiad of Metropolises)
链接:http://codeforces.com/contest/1214A. Optimal Currency Exchange#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<c...
2019-09-06 22:31:51 80
原创 Educational Codeforces Round 72 (Rated for Div. 2)
链接:http://codeforces.com/contest/1217A. Creating a Character#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#include<stack> #include<cstrin...
2019-09-06 22:27:35 89
原创 C. A Tale of Two Lands
链接:http://codeforces.com/contest/1166/problem/C题意:问有多少组(俩俩一组)组合,能使|a|,|b|在|a+b|和|a-b|之间题解:主要是要理解性质,同时思考如何节省时间。代码:#include<iostream>#include<algorithm>#include<cstdio>#include&...
2019-09-03 17:18:31 104
原创 Codeforces Round #582 (Div. 3)
链接:http://codeforces.com/contest/1213A. Chips Moving题意:向右向左+2,-2免费,+1,-1花费为1,求多少花费才能使全部数字相同代码:#include<iostream>#include<algorithm>#include<cstdio>#include<vector>#incl...
2019-08-31 14:15:32 95
原创 【XR-3】小道消息
链接:https://www.cometoj.com/contest/64/problem/B?problem_id=3516题解:只要在m+1在(n+1)/2和(n+1)之间,切m+1是一个质数,则只需要一次即可,而其他情况的话则需两次(是赛场上得出的结论)#include<iostream>#include<algorithm>#include<cstdi...
2019-08-26 23:06:43 219
原创 Codeforces Round #580 (Div. 2)
A. Choose Two Numbers题意:让你从A集合里取一个数a,B集合里也取一个数b,使得a+b同时不存在于集合A和集合B中思路:直接取A和B集合中最大元素,最大元素相加必然不在A集合或者B集合里(max_element)#include <bits/stdc++.h>using namespace std;int main() { int n, m; scan...
2019-08-26 17:03:29 89
原创 B. Uniqueness(二分+离散化)
链接:http://codeforces.com/contest/1208/problem/B题意:问去掉最小多少的一段能使所有不同数字的个数为1。题解:以去掉的长度为基准进行二分,因为ai能到达1e9,所以还要离散化,然后直接暴力查询即可。#include<iostream>#include<algorithm>#include<cstdio>#i...
2019-08-26 16:54:01 213
转载 D. Number Of Permutations
大佬的题解:https://www.cnblogs.com/CADCADCAD/p/11399524.html?tdsourcetag=s_pcqq_aiomsg
2019-08-24 10:23:07 282
原创 C. Gas Pipeline
链接:http://codeforces.com/contest/1207/problem/C题意:有一条路,除了首尾,中间可能会有一些十字路口,而你需要设置一些管道,当有十字路口时需要抬升,不同的方案造价不同,给与管道与柱子的花费,给出最小开销。题解:用贪心也是可以的,不过我觉得dp更加富有美感。下面给出dp代码:#include<iostream>#include<...
2019-08-24 00:18:07 428
原创 FZU2257——Game(kmp+博弈)
题目:Description:Alice and Bob is playing a game.Each of them has a number. Alice’s number is A, and Bob’s number is B.Each turn, one player can do one of the following actions on his own number:F...
2019-08-22 16:47:14 118
原创 C. Common Divisors(算多个数的公因数个数)
**C. Common Divisors(算多个数的公因数个数)***链接:*https://codeforces.com/problemset/problem/1203/C题意:寻找所有可以整除以上数字的约数,并且记录个数。思路:这道题,我们用最小的数字与其余数字不断进行gcd求出存在的最大因子,然后求出这个数的约数个数即可,它的约数也必是其他数字的约数。#include<io...
2019-08-22 15:26:03 219
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人