A. Magic Numbers

最新推荐文章于 2020-02-26 18:47:21 发布

Felven

最新推荐文章于 2020-02-26 18:47:21 发布

阅读量2.2k

点赞数

分类专栏： AC路漫漫

本文为博主原创文章，未经博主允许不得转载。

本文链接：https://blog.csdn.net/zhaoxinfan/article/details/9182519

版权

AC路漫漫专栏收录该内容

1761 篇文章 29 订阅

订阅专栏

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.

   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;
}