#include<bits/stdc++.h> using namespace std; int main(){ int n;cin>>n; int x1,y1,x2,y2; x1=y1=0; int l=0,r=0,u=0; int d[150]={0}; //NWSE->0123 先記錄方向 for(int i=0;i<n;i++){
6/4/2023遞迴 #include<bits/stdc++.h> using namespace std; int idx=0; vector<int>a; long long ans=0; int f(int r){ int child; if(r&1) child=3;
10/24/2022這題就是放橫的俄羅斯方塊 #include<bits/stdc++.h> using namespace std; int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); int r,c,n; int col[55]={0};//紀錄目前各column的最右端
10/24/2022#include<bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; int x1,x2,y1,y2,d; cin>>x1>>y1; n--; set<int>ans; while(n--){
10/23/2022or
By clicking below, you agree to our terms of service.
New to HackMD? Sign up