扣脚老骚

AtCoder Beginner Contest 250 A - Adjacent Squares #include <bits/stdc++.h> #define endl '\n' using namespace std; int main(){ ios::sync_with_stdio(false),cin.tie(nullptr); int h,w,r,c; cin>>h>>w>>r>>c; int dir

AtCoder Beginner Contest 247 B - Unique Nicknames #include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; #define int long long typedef long long LL; typedef long long ll; const int INF = 0x3f3f3f3f; //const int inf = 1e18; const in

AtCoder Beginner Contest 217 C - Inverse of Permutation #include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; #define int long long typedef long long LL; typedef long long ll; const int INF = 0x3f3f3f3f; //const int inf = 1e18; //con

AtCoder Beginner Contest 198 B - Palindrome with leading zeros #include <bits/stdc++.h> #pragma GCC optimize(2) using namespace std; #define int long long typedef long long LL; typedef long long ll; const int INF = 0x3f3f3f3f; //const int inf = 1e18

Panasonic Programming Contest (AtCoder Beginner Contest 195) B - Many Oranges 最小为mi=（w+b-1）/b 最大直接让mi自增倒不符和为止，即w>mab||w<maa #include <bits/stdc++.h> //#pragma GCC optimize(2) using namespace std; #define int long long typedef long long LL; typ

AtCoder Beginner Contest 190 A - Very Very Primitive Game #include <bits/stdc++.h> #pragma GCC optimize(2) #define int long long using namespace std; //const int mod = 998244353; const int inf=1e18; const int mod = 1e9 + 7; const int maxn = 3e5 + 10

AtCoder Beginner Contest 189 A - Slot #include <bits/stdc++.h> //#pragma GCC optimize(2) #define int long long using namespace std; //const int mod = 998244353; const int mod = 1e9 + 7; const int maxn = 1e3 + 10; int a[maxn]; void solve() { /*

AtCoder Beginner Contest 188 A Three-Point Shot #include <bits/stdc++.h> #define int long long using namespace std; //const int mod = 998244353; const int mod = 1e9 + 7; const int maxn = 1e6 + 10; void solve() { int x,y; cin>>x>&gt

AtCoder Beginner Contest 184 A - Determinant #include <bits/stdc++.h> #define int ll using namespace std; typedef long long ll; const int maxn=1e6+5; const int mod=998244353; void solve() { int a,b,c,d; cin>>a>>b>>c>>

AtCoder Beginner Contest 182 A - twiblr #include <bits/stdc++.h> #define int ll using namespace std; typedef long long ll; const int maxn = 1e5 + 10; const int mod = 998244353; void solve() { int a,b; cin>>a>>b; cout<<

AtCoder Beginner Contest 179 A - Plural Form #include <bits/stdc++.h> #define int ll //#pragma GCC optimize(2) using namespace std; typedef long long ll; const int maxn = 1e5 + 10; const int mod=998244353; void solve() { string s; cin>&g

AtCoder Beginner Contest 177 A - Don’t be late #include <bits/stdc++.h> //#define int ll typedef long long ll; const int INF = 0x3f3f3f3f; const int mod = 1e9 + 7; const int MAX = 1e5 + 10; using namespace std; int solve() { int d,t,s; cin&g

AtCoder Beginner Contest 176 A - Takoyaki #include <bits/stdc++.h> using namespace std; typedef long long ll; const int MAX = 2e5 + 10; const int INF=0x3f3f3f3f; const int mod=1e9+7; void solve() { ll n,x,t; cin>>n>>x>>t;

AtCoder Beginner Contest 175 A - Rainy Season #include<bits/stdc++.h> using namespace std; typedef long long ll; const int MAX=1e5+10; void solve(){ int n=0,m=0; string s; cin>>s; for (int i = 0; i < 3; ++i) { if (s[