Coder-Strike 2014 - Round 1 A. Poster
2014-04-19 12:28
239 查看
主要就是先将梯子移动到最左边或者最右边
k>n/2时移动到最右边
k<=n/2时移动到最左边
然后遍历一遍
k>n/2时移动到最右边
k<=n/2时移动到最左边
然后遍历一遍
#include <iostream> #include <vector> #include <algorithm> using namespace std; int main(){ int n,k; cin >> n >> k; string poster ; cin >> poster; if(k > n/2){ for(int i = k-1 ; i < n-1; ++ i){ cout<<"RIGHT"<<endl; } for(int i = n-1; i > 0; --i){ cout<<"PRINT "<<poster[i]<<endl; cout<<"LEFT"<<endl; } cout<<"PRINT "<<poster[0]<<endl; }else{ for(int i = k-1; i>0; --i) cout<<"LEFT"<<endl; for(int i = 0; i < n-1; ++i){ cout<<"PRINT "<<poster[i]<<endl; cout<<"RIGHT"<<endl; } cout<<"PRINT "<<poster[n-1]<<endl; } }
相关文章推荐
- 模拟 Coder-Strike 2014 - Round 1 A. Poster
- Coder-Strike 2014 - Qualification Round——A. Password Check
- codeforces Coder-Strike 2014 Round 1 A题解题报告
- Coder-Strike 2014 - Round 2
- Coder-Strike 2014 - Round 1__E-mail Addresses
- Coder-Strike 2014 - Round 2 B. Spyke Chatting
- Coder-Strike 2014 - Round 2 A. Data Recovery
- Coder-Strike 2014 - Round 2
- Coder-Strike 2014 - Round 1 B. Network Configuration
- [Codeforces]Coder-Strike 2014 - Round 1
- Coder-Strike 2014 - Round 1 B. Network Configuration
- Coder-Strike 2014 - Round 1
- Coder-Strike 2014 - Round 1 C. Pattern
- Coder-Strike 2014 - Round 1 E. E-mail Addresses
- Coder-Strike 2014 - Round 1
- Coder-Strike 2014 - Qualification Round C. Kicker(推理题)
- Coder-Strike 2014 - Round 2
- Coder-Strike 2014 - Qualification Round A. Password Check(简单字符串)
- Coder-Strike 2014 - Round 1(A~E)
- Coder-Strike 2014 - Round 1