CSES - Distance QueriesDistance-Queries-3.cpp // Author : ysh // 2024/01/18 Thu 16:31:34 // https://cses.fi/problemset/task/1135 #include<bits/stdc++.h> using namespace std; vector<vector<int

Problem - 3689Infinite-monkey-theorem.cpp // Author : ysh // 2024/01/13 Sat 15:26:11 // https://acm.hdu.edu.cn/showproblem.php?pid=3689 #include<bits/stdc++.h> using namespace std; #ifdef LOCAL #in

APCS - 11301-4.cppAPCS-11301-4.cpp // Author : ysh // 2024/01/12 Fri 16:48:01 #include<bits/stdc++.h> using namespace std; #define last(i,j) (f.at(j) - (i == 0 ? 0 : f.at(i - 1))) vector<vector&

APCS - 11301-3.cppAPCS-11301-3.cpp // Author : ysh // 2024/01/12 Fri 16:45:53 #include<bits/stdc++.h> using namespace std; #define debug(i) (i) // {cerr<<"["<<#i<<"] : [";for

Zerojudge解題紀錄 a302. NOIP2011 Day2.1.计算系数 - 高中生程式解題系統Zerojudge-a302.py # Author : ysh # 2024/01/10 Wed 11:45:55 import sys input = sys.stdin.readline print = sys.stdout.write

Zerojudge解題紀錄 a302. NOIP2011 Day2.1.计算系数 - 高中生程式解題系統Zerojudge-a302.cpp // Author : ysh // 2024/01/10 Wed 11:29:22 #include<bits/stdc++.h> using namespace std; const int R =

Codeforces出處 Codeforces Round 859 (Div. 4)難度 1100標籤 bitmasks dp greedy implementation sortings *1100 Codeforces - Subsequence-Addition-Hard-VersionSubsequence-Addition

Codeforces出處 Codeforces Round 859 (Div. 4)難度 1100標籤 brute force data structures dp greedy implementation sortings *1100 Codeforces - Subsequence-Addition-Easy-Version

Codeforces出處 Codeforces Round 752 (Div. 2)難度 800標籤 greedy *800 Codeforces - EraEra.py # Author : ysh # 2023/12/01 Fri 21:30:24 # https://codeforces.com/problemset/problem/