AtCoder
AtCoder
Fiveneves
这个作者很懒,什么都没留下…
展开
-
AtCoder Beginner Contest 158 C - Tax Increase
C - Tax Increase题目链接-C - Tax Increase题目大意解题思路附上代码#pragma GCC optimize("-Ofast","-funroll-all-loops")#include<bits/stdc++.h>#define int long long#define lowbit(x) (x &(-x))#define endl '\n'using namespace std;const int INF=0x3f3f3f3f原创 2020-05-17 01:27:26 · 265 阅读 · 0 评论 -
AtCoder Beginner Contest 158 D - String Formation
D - String Formation题目链接-D - String Formation题目大意原创 2020-05-17 01:20:46 · 202 阅读 · 0 评论 -
AtCoder Beginner Contest 158 B Count Balls
B - Count Balls题目链接-B - Count Balls题目大意解题思路附上代码#pragma GCC optimize("-Ofast","-funroll-all-loops")#include<bits/stdc++.h>#define int long long#define lowbit(x) (x &(-x))#define endl '\n'using namespace std;const int INF=0x3f3f3f3f;原创 2020-05-16 17:05:47 · 214 阅读 · 0 评论 -
AtCoder Grand Contest 043 A - Range Flip Find Route
A - Range Flip Find Route题目链接-A - Range Flip Find Route题目大意给你一个矩阵,只能向下或向右走,请你求出从(1,1)(1,1)(1,1)到(h,w)(h,w)(h,w)路径全为白的最少翻转次数解题思路DPDPDP定义一个二维数组dp[h][w],其中dp[i][j]代表到达点(i,j)(i,j)(i,j)时候黑块的最少块数输入时对矩阵进行处理,如果是#(黑块),说明如果经过需要反转,则mp[i][j]=1,否则mp[i][j]=0原创 2020-05-16 01:59:15 · 220 阅读 · 0 评论 -
AtCoder Beginner Contest 158 A - Station and Bus
A - Station and Bus题目链接-A - Station and Bus题目大意给你一个长度为333且仅有A B组成的字符串,判断是否有A B相邻解题思路只要该字符串不是AAA或BBB,则必定有A B相邻附上代码#pragma GCC optimize("-Ofast","-funroll-all-loops")#include<bits/stdc++.h>#define int long long#define lowbit(x) (x &(-x原创 2020-05-16 01:35:18 · 144 阅读 · 0 评论 -
AtCoder Beginner Contest 155 E - Payment
E - Payment题目链接-E - Payment题目大意在AtCoder王国里有面值为10x(0≤x≤100)的纸币,你去超市买一个价值为n的物品,为了付款,你会选择至少为n的一些钱,并把它交给职员。然后,办事员会把零钱还给你,问你和职员所使用的纸币的最小数目是多少解题思路类似于高精度进位,分情况讨论即可用数组a[N]记录你需要给的每种面额纸币的数目当你使用第i种面额...原创 2020-02-18 00:49:56 · 198 阅读 · 0 评论 -
AtCoder Beginner Contest 155 C - Poll
C - Poll题目链接-C - Poll题目大意给你n个只有小写字母构成的字符串,按字典序输出出现次数最多的字符串(可能有1个或多个)解题思路STL,用map记录次数,用ans记录最大次数,再遍历一遍map,将出现次数最多的字符串存入vector,排序输出即可附上代码#include<bits/stdc++.h>using namespace std;c...原创 2020-02-18 00:11:13 · 186 阅读 · 0 评论