A magic number is a number formed by concatenation of numbers 1, 14 and 144. We can use each of these numbers any number of times. Therefore 14144, 141414 and 1411 are magic numbers but 1444, 514 and 414 are not.
You're given a number. Determine if it is a magic number or not.
Input
The first line of input contains an integer n, (1 ≤ n ≤ 109). This number doesn't contain leading zeros.
Output
Print "YES" if n is a magic number or print "NO" if it's not.
Examples
Input
114114
Output
YES
Input
1111
Output
YES
Input
441231
Output
NO
这道题的题意就是让你看看一个数字是不是由 1 14 144 组成的
这里也是参考了网上大神的思路,我本来的思路比较麻烦,大神的思路清晰简单
就是从右往左来,挨着%10 ,% 100 ,%1000如果都不满足,那就是不满足条件的了,可以break了,否则就是满足条件的情况
#include<iostream>
using namespace std;
int main(){
long long x;
cin>>x;
bool flag=true;
while(x){
if(x%10!=1&&x%100!=14&&x%1000!=144){//核心代码
flag=false;
break;
}
x=x/10;
}
if(flag)
cout<<"Yes"<<endl;
else
cout<<"No"<<endl;
return 0;
}