A - Middle LetterMiddle-Letter.py # Author : ysh # 08/27/2022 Sat 20:48:38.10 # https://atcoder.jp/contests/abc266/tasks/abc266_a a = input() print(a[len(a) >> 1]) quit()

Zerojudge解題紀錄 a194. 死亡 FLAG - 高中生程式解題系統Zerojudge-a194.cpp // Author : ysh // 08/25/2022 Thu 21:45:19.09 #include<bits/stdc++.h> using namespace std; int main() { i

CSES - Grid PathsGrid-Paths.cpp // Author : ysh // 08/25/2022 Thu 17:23:21.41 // https://cses.fi/problemset/task/1638 #include<bits/stdc++.h> using namespace std; const int R = 1e9 + 7; int main()

2224 - B. 村莊與小徑 | TIOJ INFOR Online Judgecountry-and-road-2.cpp // Author : ysh // 08/25/2022 Thu 9:03:10.09 // https://tioj.ck.tp.edu.tw/problems/2224 #include<bits/stdc++.h> using namespace std;

2224 - B. 村莊與小徑 | TIOJ INFOR Online Judgecountry-and-road.cpp // Author : ysh // 08/25/2022 Thu 7:13:29.95 // https://tioj.ck.tp.edu.tw/problems/2224 #include<bits/stdc++.h> using namespace std; #

1509 - 地道問題 | TIOJ INFOR Online Judgetunnel.cpp // Author : ysh // 08/25/2022 Thu 6:52:52.49 // https://tioj.ck.tp.edu.tw/problems/1509 #include<bits/stdc++.h> using namespace std; #define int lon

Codeforces出處 Educational Codeforces Round 38 (Rated for Div. 2)難度 2000標籤 data structures graphs shortest paths *2000 Codeforces - Buy-a-TicketBuy-a-Ticket.cpp // Author

Zerojudge解題紀錄 d539. 區間 MAX - 高中生程式解題系統Zerojudge-d539-4.cpp // Author : ysh // 08/20/2022 Sat 8:02:03.34 #include<bits/stdc++.h> using namespace std; #define int long long

CSES - Prefix Sum QueriesPrefix-Sum-Queries-3.cpp // Author : ysh // 08/19/2022 Fri 22:29:12.05 // https://cses.fi/problemset/task/2166/ #include<bits/stdc++.h> using namespace std; #define int lon

CSES - Prefix Sum QueriesPrefix-Sum-Queries-2.cpp // Author : ysh // 08/19/2022 Fri 21:39:25.22 // https://cses.fi/problemset/task/2166 #include<bits/stdc++.h> using namespace std; #define int long