A. Magic Numbers

最新推荐文章于 2019-01-28 21:44:02 发布

不满de奶瓶

最新推荐文章于 2019-01-28 21:44:02 发布

阅读量528

点赞数

分类专栏：编程 C++

本文链接：https://blog.csdn.net/u011561174/article/details/10180607

版权

C++ 同时被 2 个专栏收录

10 篇文章 0 订阅

订阅专栏

编程

8 篇文章 0 订阅

订阅专栏

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

#include<stdio.h>
#include<string.h>
char a[10];
int main()
{
	int n,i,m;
	while(~scanf("%s",a))
	{
		n=strlen(a);
		int ok=1;m=0;
		for( i=0;i<n;i++)
		{
			if(a[i]!='1' && a[i]!='4')  {ok=0;break;}
			if(a[i]=='4' )
			{ 
				if(a[i+1]=='4' && a[i-1]!='1') {ok=0;break;}
				else if(a[i+1]=='4' && a[i-1]=='1')i++;
			    else if(a[i-1]!='1') {ok=0;break;}
			}
		}
		if(ok) puts("YES");
		else puts("NO");  
	}		
}