Chef and Queries Practice Coding Problem - CodeChefChef-and-Queries-2.cpp // Author : ysh // 12/15/2022 Thu 20:00:10.18 // https://www.codechef.com/problems/CHEFQUE #include<bits/stdc++.h> #include

Chef and Queries Practice Coding Problem - CodeChefChef-and-Queries.cpp // Author : ysh // 12/15/2022 Thu 19:30:10.17 // https://www.codechef.com/problems/CHEFQUE #include<bits/stdc++.h> using name

1069 - E.魔法部的任務 | TIOJ INFOR Online JudgeTIOJ-1069.cpp // Author : ysh // 12/13/2022 Tue 10:54:40.86 // https://tioj.ck.tp.edu.tw/problems/1069 #include<bits/stdc++.h> using namespace std; #ifdef L

2223 - A. 礦砂採集 | TIOJ INFOR Online JudgeTIOJ-2223.cpp // Author : ysh // 12/13/2022 Tue 7:58:35.23 // https://tioj.ck.tp.edu.tw/problems/2223 #include<bits/stdc++.h> using namespace std; int main(

2257 - G. 鳳梨關稅 | TIOJ INFOR Online JudgeTIOJ-2257.cpp // Author : ysh // 12/12/2022 Mon 9:58:21.90 // https://tioj.ck.tp.edu.tw/problems/2257 #include<bits/stdc++.h> using namespace std; #include&

2259 - I. 鐵路鋪設 | TIOJ INFOR Online JudgeTIOJ-2259.cpp // Author : ysh // 12/09/2022 Fri 16:29:56.33 // https://tioj.ck.tp.edu.tw/problems/2259 #include<bits/stdc++.h> using namespace std; const int

Codeforces出處 CROC-MBTU 2012, Elimination Round (ACM-ICPC)難度 1800標籤 dp hashing strings *1800 Codeforces - Queries-for-Number-of-PalindromesQueries-for-Number-of-Palindrom

Codeforces出處 Codeforces Global Round 21難度 1900標籤 binary search constructive algorithms data structures divide and conquer greedy shortest paths *1900 Codeforces - Per

程式練習網APCSP-a137-2.cpp // Author : ysh // 12/08/2022 Thu 9:39:23.25 // https://apcsclass.csie.ntnu.edu.tw/ShowProblem?problemid=a137 #include<bits/stdc++.h> using namespace std; #ifdef LOCAL #inclu

Codeforces出處 Educational Codeforces Round 32難度 1800標籤 bitmasks divide and conquer meet-in-the-middle *1800 Codeforces - Maximum-Subsequence-2Maximum-Subsequence-2.cpp //