AtCoder Beginner Contest 373 A - September# 题意# 给12个字符串,问长度等于标号的字符串个数。 思路# 模拟。 代码# 点击查看代码 #include<bits/stdc++.h> using namespace std; #define int long long void solve() { int ans = 0; for (int i = 0; i < 12; i++) { string s; ...
} C - Max Ai+Bj (abc373 C) 题目大意 给定两个数组a,ba,b,分别从中选一个数,使得和最大。 解题思路 显然选的两个数分别为最大的数即可。python可以两行。 神奇的代码 input() print(max(map(int, input().split())) + max(map(int, input().split())) D - Hidden Weights (abc373 D) 题...
#include <bits/stdc++.h> using ll = long long; int main() { std::ios::sync_with_stdio(false); std::cin.tie(0); int n; std::cin >> n; std::vector<int> a(n), b(n); for (int i = 0; i < n; i++) { std::cin >> a[i] >> b[i]; } std::vector<int> c(n...
using namespace std; const int maxn=2e5+100; vector<int> adj[maxn]; int n,m,u[maxn],v[maxn],w[maxn],cb[maxn],ans[maxn]; queue<int> q;//bfs先给出点为零的点赋值 //map<int,int,int> bq; map<pair<int,int>, int> bq; int flag[maxn]; signed main() { cin>>n>>m...
We will hold AtCoder Beginner Contest 373.Contest URL: https://atcoder.jp/contests/abc373Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20240928T2100&p1=248Duration: 100 minutesWriter: sotanishy, MtSaka, evimaTester: MMNMM, cn449...
586 1 30:27 App AtCoder Beginner Contest 373(A ~ F 题讲解) 671 2 26:04 App AtCoder Beginner Contest 372(A ~ F 题讲解) 520 3 23:11 App AtCoder Beginner Contest 371(A ~ F 题讲解) 432 0 23:18 App AtCoder Beginner Contest 385(A ~ F 题讲解) 633 5 20:12 App AtCoder Beginn...
AtCoder Beginner Contest 374 代码中已去除冗余 A Takahashi san 2 直接判断末尾字符串是否为"san"即可,时间复杂度O(1) import java.util.*; public class Main{ public static void main(String args[]){ Scanner sc=new Scanner(System.in);
AtCoder Beginner Contest ABC-361-B https://www.bilibili.com/video/BV1M7bkeYEh1/ AtCoder Beginner Contest ABC-361-C https://www.bilibili.com/video/BV1KpbkeFEWo/ AtCoder Beginner Contest ABC-361-D https://www.bilibili.com/video/BV1Kg8kewEio/ 【比赛讲评】AtCoder Beginner Contest 361 A...
AtCoder Beginner Contest 193 部分题解 E - Oversleeping 求是否存在\(t\)满足\(t=t_1(mod (2X+2Y)) and t=t_2(mod (P+Q))\) 注意到\(Q\)和\(Y\)非常小,直接枚举套个\(exCRT\)就行了(虽然赛场上没看出来,\(exCRT\)也忘了记得快速乘...
AtCoder Beginner Contest 043题解(ABCD) 传送门 A - Children and Candies (ABC Edit) 题意:求 ∑ i = 1 n i \sum\limits_{i=1}^n i i=1∑ni 思路:签到题,直接按照公式输出 n ( n + 1 ) 2 \dfrac{n(n+1)}{2} 2n(n+1)。