quinn18的博客

文章目录C - ConnectionsD - Designing the ToyA - Archery TournamentL. Laminar Family总结C - Connections题目链接思维题意：给你一张能到达任意点的图，m>2∗n,m<100000m>2*n, m<100000m>2∗n,m<100000，删掉m−2∗nm-2*nm−2∗n条路使这张图仍然能到达任意点本来就考虑这张图找一个环，后来发现会有很多环。题目留下2∗n2*n2∗n..

文章目录A - Casimir's String SolitaireB - Shifting SortC - TicksD - Productive MeetingE1 - Permutation Minimization by DequeE2. Array Optimization by Deque总结A - Casimir’s String Solitaire题目链接题意：给你一个串，每次可以删一个 AAA 和一个 BBB 或者删一个 BBB 和 CCC 问你最后能不能删光所有的字符所以一..

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档文章目录A - The Miracle and the SleeperB - Scenes From a MemoryC - RingsD1 - Two Hundred Twenty One (easy version)D2 - Two Hundred Twenty One (hard version)总结A - The Miracle and the Sleeper添加链接描述题意：l,rl, rl,r 里找两个数 a>=b

文章目录A - Simply Strange SortB - Charmed by the GameC - Deep Down BelowD1 - Up the Strip (simplified version)总结A - Simply Strange Sort题目链接题意：a[i]>a[i+1]a[i]>a[i+1]a[i]>a[i+1]就可以交换直到序列升序，第奇数次迭代 iii 只能是奇数，偶数同理暴力模你一开始没看题直接乱摸T^T然后就是要注意check整个序列..

文章目录A. Dislike of ThreesB. Who's Opposite?C. Infinity TableD. Make a Power of TwoE. Polycarp and String TransformationF1. Nearest Beautiful Number (easy version)F2. Nearest Beautiful Number (hard version)总结A. Dislike of Threes题目链接十进制中去掉能被三整除或个位数是三的数，问.

文章目录A - Arithmetic ArrayB - Bad BoyC - Challenging CliffsD - Deleting DivisorsE1 - Erase and Extend (Easy Version)E2 - Erase and Extend (Easy Version)F - Figure Fixing总结A - Arithmetic Array#include<iostream>#include<cmath>#include<iom..

提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档文章目录A - Stone GameB - Friends and CandiesC - Number of PairsD - Another Problem About Dividing NumbersF - Interesting Function总结A - Stone Game提示：这里可以添加本文要记录的大概内容：#include<bits/stdc++.h>using namespace std;typed

文章目录A - Omkar and Bad StoryB - Prinzessin der VerurteilungC - Diluc and KaeyaD - Omkar and Medians总结A - Omkar and Bad Story没想法 直接就模拟了。。结果告诉正解是输出0~100。。。。。#include <bits/stdc++.h>#define endl '\n'using namespace std;typedef long long ll;int..

文章目录A - Game of LifeB - Lord of the ValuesC - Compression and Expansion总结A - Game of Life题意：给你一个长nnn的010101串，1是活细胞永远不死，000是死细胞当他边上恰好只有一个活细胞他才能复活，每111次就有满足细胞复活，问mmm次的010101串所以就是把111向前向后延伸mmm的长度并且我们可以知道假如mmm无线大10001中间的0是绝对不会复活的#include<bits/stdc++..

目录A - Mean Inequality题意:想也不想直接暴力数组开小了然后。。

目录A - Eshag Loves Big ArraysB - Sifid and Strange SubsequencesC - Parsa's Humongous TreeA - Eshag Loves Big Arrays题意：就是 总数−-−最小值的个数#include<bits/stdc++.h>#define ll long longusing namespace std;const int N = 105;int t, n, m, a[N];int main..

目录A - Potion-makingB - Permutation SortC - Armchairs总结A - Potion-making题意：加精华和加水配置成kkk%的魔法水最少加几步#include<bits/stdc++.h>using namespace std;typedef long long ll;int n, m, t;int main() { cin>>t; while(t--) { cin>>n.

目录A - Nastia and nearly Good NumbersB - Ordinary NumbersC - Nastia and a Hidden Permutation总结A - Nastia and nearly Good Numbers题目链接构造题意：给你A,BA, BA,B 输出x,y,zx, y, zx,y,z, 满足x+y=zx+y=zx+y=z， 三个都是A的倍数，两个不是B的倍数#include<bits/stdc++.h>using namespa.

目录A - Do Not Be Distracted!B - Ordinary NumbersC - Not Adjacent MatrixD - Same Differences总结提示：以下是本篇文章正文内容，下面案例可供参考A - Do Not Be Distracted!题意：一个字母只能在一堆出现，后面不能出现#include <bits/stdc++.h>using namespace std;typedef unsigned long long ll;const .

目录A - Phoenix and GoldB - Phoenix and PuzzleC - Phoenix and TowersD - Phoenix and SocksE - Phoenix and Computers总结A - Phoenix and Gold构造？B - Phoenix and Puzzle想法C - Phoenix and Towers贪心D - Phoenix and Socks模拟E - Phoenix and Computers区间dp总结

目录A - Red and Blue BeansB - The Cake Is a LieC - Berland Regional总结A - Red and Blue Beans题意：给你一袋有nnn个红豆一袋mmm个蓝豆问你能不能分为好几袋abs(n−m)<=kabs(n-m)<=kabs(n−m)<=k所以就是判断最大程度分能不能达到<=k<=k<=k#include<bits/stdc++.h>#define ll long longusi

题意:问你一个数能否由只2050或20500或20500或205000或2050000…组成所以只要看能不能被2050整除

文章目录A - Tit for TatB - AGAGA XOOORRRC - Baby Ehab Partitions Again未完A - Tit for Tat题意：给你长为nnn的数组， 你可以进行kkk次操作。任意挑选两个元素进行一个加 111 一个减 111 操作，使数组变成字典上最小的不包含负数的数组所以就是从前往后能k次操作能减就减为0，不能的话就减kkk，加一的话就在最后的元素加111;#include <iostream>#define ll long long

111Codeforces Round #716 (Div. 2)ABCD目录Codeforces Round #716 (Div. 2)ABCDA.Perfectly Imperfect ArrayB.AND 0, Sum BigC.Product 1 Modulo ND.Cut and StickA.Perfectly Imperfect Array题意：给你个序列判断是否子序列不是理想的平方所以在给你的一串数组里判断是否有一个不是平方数即可#include<bits/stdc++.