AtCoder Beginner Contest 402(A-F详细题解) A 思路:我们直接输出字符串中的大写字母即可。 代码:#include<bits/stdc++.h> using namespace std; #define int long long #define N 500010 signed main(){ string s;cin>>… 秋日薄雾 AtC
AtCoder Beginner Contest 405 A-F 简易题解,如果题解中有什么问题可以找我反馈,谢谢! A.Is it rated?直接按照题目条件判断即可 int main(){ int x, y; cin >> x >> y; if(y == 1 && 1600 <= x … 枫落发表于Atcod... AtCoder Beginner Contest 359 (A-G个人...
【赛题讲解】AtCoder Beginner Contest 285 ABCDE 讲评 09:33 【赛题讲解】Codeforces Round #843 (Div. 2) A1A2两种难度精讲 05:36 【赛题讲解】【abc282】 - D . Make Bipartite 2 二分图、连通块 普及+/提高-难度 精讲,代码,坑点挖掘 08:00 【赛题讲解】abc282 C - String Delimiter 02:...
double aa[MAXN], bb[MAXN]; double burntime[MAXN]; double prefix[MAXN], suffix[MAXN];int main() { n = read(); for (int i = 1; i <= n; ++i){ aa[i] = read(); bb[i] = read(); burntime[i] = (double) aa[i] /(double) bb[i]; ...
} ps[MAXN]; int n; int main() { n = read(); rep (i, 1, n) { ps[i].x = readll(); ps[i].y = readll(); } long long int ans = 0; rep (i, 1, n) { rep (j, i + 1, n) { rep (k, j + 1, n) { int x1 = ps[i].x, x2 = ps[j].x, x3 = ps[...
TOYOTA MOTOR CORPORATION Programming Contest 2022(AtCoder Beginner Contest 270)(DP + 二分 + 最小生成树(超源) 1-2-4 Test Problem Statement There was an exam consisting of three problems worth 11, 22, and 44 points. Takahashi, Aoki, and Snuke took this exam. Takahashi scored AA...
AtCoder Beginner Contest 170 (D~F题,D筛法,E multiset使用,F Dijkstra算法改进),题目链接:HereABC水题,D.NotDivisible看了题解才想到,可以用SieveofEratosthenes,因为\(A_i\)最大才\(10^6\)但有注意的点11522233522244511112重复出现的数字简单的...
这里面首先能想到的就是优化 发现 可以分区间了,所以 用前缀和来优化掉每一个求和 注意处理边界,但是不懂为什么要在前缀和相减的时候加上p,不加就wa,加了就过了 #include<bits/stdc++.h>#defineendl'\n'#definefrfirst#definesesecond#definemem(x,y)memset(x,y,sizeofx)usingnamespacestd;typedeflonglong...
AtCoder Beginner Contest 151的数学推导难不难? 组合数在AtCoder Beginner Contest 151中怎么运用? AtCoder Beginner Contest 151有哪些数论相关的题? 思路统计最大值出现的次数,和最小值出现的次数。虽然是每次都是MAX-MIN,我们先求MAX的和,然后再求MIN的和,做差。 这次代码写的真的很漂亮 题目地址: 代码语言...