https://atcoder.jp/contests/abc148 这场比较简单D - Brick Break二分or LIS#include <bits/stdc++.h> #define ll long long using namespace std; const int N = 200005; int a[N], n, ans = 1, f[N]; //f[i]:以i结尾 map<int, int> mp; bool suc; set<int> s[N]; int main (...
ABC 148 第一次打abc,记录一下 Task NameTime LimitMemory Limit ARound One2 sec1024 MB BStrings with the Same Length2 sec1024 MB CSnack2 sec1024 MB DBrick Break2 sec1024 MB EDouble Factorial2 sec1024 MB FPlaying Tag on Tree2 sec1024 MB ...
Easy ABC! I can get higher rating. Thx problem provider. →Reply Jerrlee 2 years ago,#| +14 In fact,I think B is easier than A... (Maybe I'm strange. →Reply llc5pg 2 years ago,#^| 0 I solved B, but not able to solve A. ...
2019-12-22 22:31 − [TOC] # AtCoder Beginner Contest 148 题解 ## 前言 **包含题目:** [ABC148 A](https://atcoder.jp/contests/abc148/tasks/abc148_a) [ABC148 B](https://atcoder.jp/co... BurnoutAg7 0 536 AtCoder Beginner Contest 143 F - Distinct Numbers 2019-12-14 14:...
2019-12-22 22:31 −[TOC] # AtCoder Beginner Contest 148 题解 ## 前言 **包含题目:** [ABC148 A](https://atcoder.jp/contests/abc148/tasks/abc148_a) [ABC148 B](https://atcoder.jp/co... BurnoutAg7 0 534 AtCoder Beginner Contest 143 F - Distinct Numbers ...
XCPC萌新交流互助群:174495261https://atcoder.jp/contests/abc272/tasks/abc272_g题意问题陈述给你一个长度为 的由正整数组成的序列 ,其中… AtCoder Beginner Contest 349 A~F AC-Panda 敲代码的老熊猫 A. Zero Sum Game(思维) 题意 有 个人一起参加游戏,开始时每个人均拥有 点分数。每轮游戏只会在两个...
ContestA ProblemB ProblemC ProblemD ProblemE ProblemF Problem DISCO presents ディスカバリーチャンネル コードコンテスト2020 予選 B - Iron Bar CuttingPython ABC Like ContestContestB ProblemC ProblemD ProblemE ProblemF Problem パナソニックプログラミングコンテスト2020 B - BishopPython C -...
Available add-ons Advanced Security Enterprise-grade security features GitHub Copilot Enterprise-grade AI features Premium Support Enterprise-grade 24/7 support Pricing Search or jump to... Search code, repositories, users, issues, pull requests... Provide feedback We read every piece of ...
atcoder abc166-D 题目大意:找出A和B使得A5-B5=X。 思路: 最主要是确定枚举范围,要使A5-B5最小,就要让A和B最接近,所以可以算N5-(N-1)5,循环N直到大于1e9,那就确定了范围。 反思:假设A或B为0找范围显然是不合适的。 代码: #include<bits/stdc++.h>usingnamespacestd;#defineLL long longconstLL ...
abc出现次数的最大值和最小值相差不超过1 代码 #include <bits/stdc++.h> #define fi first #define se second #define pii pair<int,int> #define pdi pair<db,int> #define mp make_pair #define pb push_back #define enter putchar('\n') #define space putchar(' ') #define eps 1e-8 #...