#include<bits/stdc++.h>#defineint long longusingnamespacestd;constintN=1e6+10;voidsolve(){chara, b, c; cin >> a >> b >> c;if(a =='<') {if(c =='<') { cout <<"B"<< endl;return; }else{if(b =='<') { cout <<"C"<< endl;return; }else{ cout <<"A"<< endl;...
AtCoder Beginner Contest 371 A - Jiro (abc371 A) 题目大意 三个人,给定他们相互之间的大小关系。 问谁在中间。 解题思路 排个序,大小结果就是题目给的,因为问的是中间是谁,所以写的时候并没在意是升序排还是降序排。 神奇的代码 #include<bits/stdc++.h> usingnamespacestd; usingLL =longlong; intmain...
void prin()//先填再删 { num=0; for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { bj[i][j]=flag[i][j]; bjj[i][j]=flagg[i][j]; } } for(int i=1;i<=n;i++) { dt[i]=aa[i]; yl[aa[i]]=i; } //先添 for(int i=1;i<=n;i++) { for(int j=i+...
图G有M\_G条边,它的第i条边(1\leq i\leq M\_G)连接顶点u\_i和v\_i。图H有M\_H条边,它的第i条边(1\leq i\leq M\_H)连接顶点a\_i和b\_i。 您可以在图H上执行以下操作,次数不限,可能为零。 选择一对满足1\leq i\lt j\leq N的整数(i,j)。支付A\_{i,j}日元,如果在H中顶点i和...
662 0 43:18 App AtCoder Beginner Contest 380(A ~ G 题讲解) 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 Beginn...
Atcoder beginner contest 317, ABCDE https://www.bilibili.com/video/BV1614y1C7Bx/ AtCoder Beginner Contest 317 https://www.bilibili.com/video/BV1Cu4y1e7VR/ https://www.bilibili.com/video/BV1hu4y1D7pz/ https://www.bilibili.com/video/BV1D14y1C7wq/ https://www.bilibili.com/video/BV...
We will hold AtCoder Beginner Contest 137. Contest URL: https://atcoder.jp/contests/abc137 Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20190810T2100&p1=248 Duration: TBD (around 2 hours) Number of Tasks: 6 writer:potetisensei HIR180 Drafear yokozuna57 DEGwer ...
AtCoder Beginner Contest 284(A~F) 编程算法 A - Sequence of Strings --- Original Link 题目大意:输入 N 个字符串,倒序输出。 --- 思想:签到题。 --- 代码: #include <iostream> #include <cstring> #include <cstdio> #include <algorithm> #include <cmath> #include <sstream> #include <vector...
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 171 题解 A #include<bits/stdc++.h> using namespace std; int main(){ char t; cin>>t; putchar(islower(t)? 'a': 'A'); return 0; } 1. 2. 3. 4. 5. 6. 7. 8. B #include<bits/stdc++.h> using namespace std;...