https://zerojudge.tw/ShowProblem?problemid=f313```cpp= #include <bits/stdc++.h> using namespace std; /* 2 3 4 1 10 2 -1 5 -1 2 */ int main(){

io優化 cin.tie(0); ios_base::sync_with_stdio(false); String int to string .to_string() 32位元int to binary string stoi()``string a2 = bitset<32>(a).to_string();

https://zerojudge.tw/ShowProblem?problemid=g501 #include <bits/stdc++.h> using namespace std; int main(){ cin.tie(0); ios_base::sync_with_stdio(false); vector<int> v = { {1, 2, 3, 5, 6, 8, 11, 13, 17, 21, 22},

#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; n -= 1; unsigned long long tri[120], side[120]; tri[0] = 1; side[0] = 3;

#include <bits/stdc++.h> using namespace std; int main(){ int a, b, c; cin>>a>>b>>c; int lim = c/b; int h[a]; priority_queue< pair<int, int> > cans; // {height, place} for(int i=0; i<a; i++){ int can; cin>>can;

#include <bits/stdc++.h> using namespace std; /* 1 1 1 1 1 1 0 1 1 1 1 0 1 0 1 0 0 1 0 1 0 0 1 0 0 */

筆記 萬用表頭: #include <bits/stdc++.h> 加速運行: ios::sync_with_stdio(0); cin.tie(0); cin 和 scanf / sscanf 混用時不可寫上述兩行

E. Make Them Odd Not done https://codeforces.com/group/n75uQpTCBs/contest/337574/problem/E Problem Analysis Source Code t = int(input()) for case in range(t): n = int(input())

A. Balanced Team https://codeforces.com/group/n75uQpTCBs/contest/325340/problem/A status: done Problem Analysis List S is a sublist of the input list a . Find the maximum length of list S while S.max() - S.min() <= 5. Source Code n = int(input()) students = list( map(int, input().split()) )