2052 - 排列第幾個？（Permutation） | TIOJ INFOR Online JudgeTIOJ-2052-2.cpp // Author : ysh // 03/04/2023 Sat 18:00:11.70 // https://tioj.ck.tp.edu.tw/problems/2052 #include<bits/stdc++.h> using namespace

2052 - 排列第幾個？（Permutation） | TIOJ INFOR Online JudgeTIOJ-2052.cpp // Author : ysh // 03/04/2023 Sat 11:56:36.69 // https://tioj.ck.tp.edu.tw/problems/2052 #pragma GCC optimize("O3,unroll-loops") #prag

CSES - Download SpeedDownload-Speed.cpp // Author : ysh // 02/28/2023 Tue 15:47:23.72 // https://cses.fi/problemset/task/1694 #include<bits/stdc++.h> using namespace std; #ifdef LOCAL #include<d

TCIRC解題紀錄 d093. P-7-4. 方格棋盤的最少轉彎數路線 - TCFSH CIRC JudgeAP325-d093-2.cpp // Author : ysh // 02/26/2023 Sun 18:26:33.16 // https://judge.tcirc.tw/ShowProblem?problemid=d093 #incl

CSES - Reachable NodesReachable-Nodes.cpp // Author : ysh // 02/25/2023 Sat 7:08:07.73 // https://cses.fi/problemset/task/2138 #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2,bmi,bmi

Meet in the Middle折半枚舉 // Author : ysh // 02/24/2023 Fri 13:28:19.73 // https://cses.fi/problemset/task/1628 #include<bits/stdc++.h> using namespace std; #define int long long void check(int l,int

CSES - InvestigationInvestigation-2.cpp // Author : ysh // 02/24/2023 Fri 8:25:57.35 // https://cses.fi/problemset/task/1202 #include<bits/stdc++.h> using namespace std; const int R = (1e9) + 7; #

CSES - Path QueriesPath-Queries.cpp // Author : ysh // 02/23/2023 Thu 20:25:12.24 // https://cses.fi/problemset/task/1138 #include<bits/stdc++.h> using namespace std; #include<tree> #define int

CSES - ProjectsProjects.cpp // Author : ysh // 02/23/2023 Thu 14:02:52.86 // https://cses.fi/problemset/task/1140 #include<bits/stdc++.h> using namespace std; #define int long long signed main() &#

Codeforces - Genetic-Sequence-Searching-2Genetic-Sequence-Searching-2.cpp // Author : ysh // 02/21/2023 Tue 14:20:26.29 // https://codeforces.com/gym/425267 #include<bits/stdc++.h> using namespace