Codeforces出處 Codeforces Round 772 (Div. 2)難度 800標籤 greedy *800 Codeforces - Avoid-Local-MaximumsAvoid-Local-Maximums.cpp // Author : ysh // 02/20/2022 Sun 22:51:17.00 // h

Alphabet – Kattis, Kattiskattis-Alphabet2.cpp // Author : ysh // 02/20/2022 Sun 10:36:21.45 // https://open.kattis.com/problems/alphabet #include<bits/stdc++.h> using namespace std; int main() 

Codeforces - mining-water-chestnutmining-water-chestnut.cpp // Author : ysh // 02/14/2022 Mon 13:06:32.40 // https://codeforces.com/group/H0qY3QmnOW/contest/366708/problem/J #include<bits/stdc++.h>

Codeforces - Perfect-takePerfect-take.cpp // Author : ysh // 02/14/2022 Mon 13:00:20.27 // https://codeforces.com/group/H0qY3QmnOW/contest/366708/problem/D #include<bits/stdc++.h> using namespace s

Codeforces - Colten-work-in-THSRColten-work-in-THSR.cpp // Author : ysh // 02/13/2022 Sun 16:03:37.98 // https://codeforces.com/group/H0qY3QmnOW/contest/366708/problem/I #include<bits/stdc++.h> usi

Codeforces - XOR-and-OR-problemXOR-and-OR-problem.cpp // Author : ysh // 02/13/2022 Sun 15:39:52.90 // https://codeforces.com/group/H0qY3QmnOW/contest/366708/problem/H #include<bits/stdc++.h> using

Codeforces - Colten’s-math-problemColten’s-math-problem.cpp // Author : ysh // 02/13/2022 Sun 15:19:55.74 // https://codeforces.com/group/H0qY3QmnOW/contest/366708/problem/G #include<bits/stdc++.h>

Codeforces - bamboo’s-bamboo-sequencebamboo’s-bamboo-sequence.cpp // Author : ysh // 02/13/2022 Sun 15:03:59.52 // https://codeforces.com/group/H0qY3QmnOW/contest/366708/problem/F #include<bits/std

Codeforces - Water-problemWater-problem.cpp // Author : ysh // 02/13/2022 Sun 14:49:28.75 // https://codeforces.com/group/H0qY3QmnOW/contest/366708/problem/E #include<bits/stdc++.h> using namespace

Codeforces - Power-of-artPower-of-art.cpp // Author : ysh // 02/13/2022 Sun 14:21:09.41 // https://codeforces.com/group/H0qY3QmnOW/contest/366708/problem/C #include<bits/stdc++.h> using namespace s