题集
文章平均质量分 87
a1214034447
这个作者很懒,什么都没留下…
展开
-
Educational Codeforces Round 112 (Rated for Div. 2) 题解
题目链接:http://codeforces.com/contest/1555A. PizzaForcessolve: gcd是120,但是要处理240之内的最优情况,因为121就不是120+1。#include<bits/stdc++.h>using namespace std;#define inf 0x3f3f3f3ftypedef long long ll;const int mx = 3e2 + 10;int sum[mx];int main(){ mem.原创 2021-08-03 22:36:51 · 250 阅读 · 0 评论 -
CodeForces #545(div.2)题解
题目链接:http://codeforces.com/contest/1138A. Sushi for Two解题思路:利用"缩点"变成1,2,1,2...或者2,1,2,1...的模式然后每个点都有权值,权值就是原序列相同连续段的总数。最后枚举相邻的两个取max就好了。#include<iostream>#include<cstdio>#inc...原创 2019-03-14 14:14:05 · 187 阅读 · 0 评论 -
Codeforces Round #546 (Div. 2) 题解
题目链接:http://codeforces.com/contest/1136A. Nastya Is Reading a Book水题。#include <bits/stdc++.h>#define fi first#define se second #define lson l,mid,rt<<1#define rson mid+1,r,rt...原创 2019-03-19 21:16:01 · 208 阅读 · 0 评论 -
Comet OJ - Contest #0 题解
题目链接:https://cometoj.com/contest/34/problemsA.解方程,(由公式可知y>=z,0<=n<=根号x)移项再平方可得那么如果n是个平方数,很明显解有无穷多个。否则必须满足 n = 4*y*z才有整数解,即 x = (z+y)。所以只要枚举n/4的所有因子就好了。(注意这样做卡longlong,要想不卡去筛素数吧)...原创 2019-04-03 21:15:08 · 652 阅读 · 1 评论 -
Codeforces Round #548 (Div. 2) 题解
题目链接http://codeforces.com/contest/1139A. Even Substrings判断个位是否是奇数即可。#include <iostream>#include <set>#include <array>#include <vector>using namespace std;typedef...原创 2019-03-31 18:03:58 · 378 阅读 · 0 评论 -
Codeforces Round #553 (Div. 2) 题解
题目链接:http://codeforces.com/contest/1151A. Maxim and Biology暴力每个做起点即可。#include <bits/stdc++.h>using namespace std;typedef long long ll;const int mx = 1e2 + 10;char s[mx]; int main(...原创 2019-04-25 21:54:53 · 165 阅读 · 0 评论 -
Codeforces Round #551 (Div. 2) 题解
题目链接:http://codeforces.com/contest/1153A. Serval and Bus计算每一班车到达车站的时间超过m,并且离m最近的时间去最小就好了。#include <bits/stdc++.h>using namespace std;const int mx = 1e2 + 10;int main(){ int n,m; ...原创 2019-04-23 17:05:14 · 209 阅读 · 0 评论 -
Comet OJ - Contest #2 A-E
题目链接:https://cometoj.com/contest/37/problemsA.因自过去而至的残响起舞对于爆炸型增长的数来说,增长到x只需要log级别就ok了,所以直接暴力就好了。#include <bits/stdc++.h>using namespace std;typedef long long ll;const int mx = 1e5 +...原创 2019-04-29 12:34:18 · 278 阅读 · 0 评论 -
Codeforces Round #566 (Div. 2) A-E
题目链接:http://codeforces.com/contest/1182A. Filling Shapes每两列有2种方法,所以是2的n/2次方#include <bits/stdc++.h>using namespace std;typedef long long ll;const int mod = 998244353;const int mx =...原创 2019-06-13 16:38:16 · 351 阅读 · 0 评论