Codeforces Round #189 (Div. 2) A. Magic Numbers
2013-06-24 00:01
246 查看
#include <iostream> #include <vector> #include <algorithm> #include <string> using namespace std; int main(){ long long n; cin >>n; while(n){ if(n%10 == 1) n/=10; else if(n%100 == 14 ) n/=100; else if(n%1000 == 144) n/=1000; else { cout<<"NO"<<endl;return 0;} } cout<<"YES"<<endl; return 0; }
相关文章推荐
- Codeforces Round #189 (Div. 2)---A. Magic Numbers
- Codeforces Round #189 (Div. 1) B. Psychos in a Line
- Codeforces Round #189 (Div. 2)
- Codeforces Round #189 (Div. 2) B
- Codeforces Round #189 (Div. 2) A题
- Codeforces Round #189 (Div. 2) D. Psychos in a Line 单调队列dp
- Codeforces Round #189 (Div. 2)
- Codeforces Round #189 (Div. 2) 解题报告
- Codeforces Round #189 (Div. 2) 解题报告
- Codeforces Round #189 (Div. 1)
- Codeforces Round #189 (Div. 1) B. Psychos in a Line 单调队列
- Codeforces Round #189 (Div. 1)
- Codeforces Round #189 (Div. 1) Kalila and Dimna in the Logging Industry 斜率DP
- Codeforces Round #170 (Div. 2)
- Codeforces Round 134 div 2 C题
- Codeforces Round #134 (Div. 2) A_B_C_D题
- Codeforces Round #143 (Div. 2) (边双联通)
- Codeforces Round #185 (Div. 1) && (Div. 2)
- Codeforces Round #218 (Div. 2) (线段树区间处理)
- Codeforces Round #245 (Div. 2) B. Balls Game 并查集