A. Magic Numbers

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A magic number is a number formed by concatenation of numbers 114 and 144. We can use each of these numbers any number of times. Therefore 14144141414 and 1411 are magic numbers but 1444514 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.

Sample test(s)
input
114114
output
YES
input
1111
output
YES
input
441231
output
NO

解题说明:此题是给出一个数字串判断是否只由1,14和144组成,每次只需要判断该字符串的最后三位余数,如果这三位余数中不存在1,14,144,那么结论就为假。


#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include<set>
#include <algorithm>
using namespace std;

int main()
{
    long int n;
	bool t;
    scanf("%ld", &n);
    t = true;
    while(n)
    {
        if(n%10!=1 && n%100!=14 && n%1000!=144)
        {
            t = false;
            break;
        }
        n /= 10;
    }
    if(t)
	{
		printf("YES\n");
	}
	else
	{
		printf("NO\n");
	}
	return 0;
}
	


已标记关键词 清除标记
©️2020 CSDN 皮肤主题: 编程工作室 设计师:CSDN官方博客 返回首页