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},
{2, 3, 5, 7, 8, 13, 16, 17, 21, 22, 24},
{1, 3, 5, 6, 7, 15, 16, 17, 22, 23, 24, 25},
{2, 4, 5, 7, 8, 15, 17, 21, 23, 25}
}
int arr[25][4];
for(int i=0; i<25; i++){
for(int j=0; j<4; j++){
arr[ v[i][j] ] = 0;
}
}
for(int i=0; i<4; i++){
for(int j=0; j<v[i].size(); j++){
arr[ v[i][j]-1 ]++;
}
}
int h, n; cin>>h>>n;
h -= 1;
}
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(){
Nov 2, 2021io優化 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();
Nov 2, 2021#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;
Oct 19, 2021#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;
Oct 19, 2021or
By clicking below, you agree to our terms of service.
New to HackMD? Sign up