--- tags : 題單 --- # 第四次社課題單 <font color="#800080">※</font>:第一節講解 <font color="#f00">※</font>:第二節講解 (1):第一節練習 (2):第二節練習 ## easy ### array > (1)https://zerojudge.tw/ShowProblem?problemid=e998 >(1)https://judge.tcirc.tw/ShowProblem?problemid=b030 ### string > (1)https://atcoder.jp/contests/abc219/tasks/abc219_b ### 輸出 > <font color="#f00">※</font>https://judge.tcirc.tw/ShowProblem?problemid=b020 ### 數學 >(2)https://zerojudge.tw/ShowProblem?problemid=g497 > (2)https://leetcode.com/problems/palindrome-number/ > <font color="#f00">※</font>https://leetcode.com/problems/add-digits/ ### 輸入處理 > <font color="#800080">※</font>https://leetcode.com/problems/multiply-strings/ --- ## normal ### array (1)https://zerojudge.tw/ShowProblem?problemid=f149 ### string > <font color="#800080">※</font>https://zerojudge.tw/ShowProblem?problemid=d574 ### 流程控制 > <font color="#f00">※</font>https://judge.tcirc.tw/ShowProblem?problemid=a002 ### 迴圈 > <font color="#f00">※</font>https://zerojudge.tw/ShowProblem?problemid=f044 ## hard ### string > (1)https://judge.tcirc.tw/ShowProblem?problemid=b053 ### simulation (2)https://leetcode.com/problems/walking-robot-simulation/ (2)https://leetcode.com/problems/solve-the-equation/ ```cpp= #include<bits/stdc++.h> using namespace std; const int max_l=1e4; int main(){ string ans,ss,s1,s2,s3,t; int leng=0; cin>>s1>>s2>>s3>>t; for(int i=0;i<t.length();i+=1){ if(t[i]-'0'==1) ss=s1; if(t[i]-'0'==2) ss=s2; if(t[i]-'0'==3) ss=s3; if(i==0) ans=ss; if(i>0) ans+=ss; } cout<<ans<<'\n'; } ```
×
Sign in
Email
Password
Forgot password
or
By clicking below, you agree to our
terms of service
.
Sign in via Facebook
Sign in via Twitter
Sign in via GitHub
Sign in via Dropbox
Sign in with Wallet
Wallet (
)
Connect another wallet
New to HackMD?
Sign up