Codeforces Round #189 (Div. 2) A题
2013-06-23 22:24
375 查看
这题主要的解决方法在于,4不能在第一位,三个4不能再一起,还有就是这些数字只能有1和4!
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
string s;
int main()
{
int i;
cin>>s;
for(i=0; s[i]!='\0'; i++)
{
if(s[i]=='1'||s[i]=='4')
{
if(s[0]=='4')
{
printf("NO\n");
return 0;
}
else if(s[i]=='4'&&s[i+1]=='4'&&s[i+2]=='4')
{
printf("NO\n");
return 0;
}
}
else
{
printf("NO\n");
return 0;
}
}
printf("YES\n");
return 0;
}
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
string s;
int main()
{
int i;
cin>>s;
for(i=0; s[i]!='\0'; i++)
{
if(s[i]=='1'||s[i]=='4')
{
if(s[0]=='4')
{
printf("NO\n");
return 0;
}
else if(s[i]=='4'&&s[i+1]=='4'&&s[i+2]=='4')
{
printf("NO\n");
return 0;
}
}
else
{
printf("NO\n");
return 0;
}
}
printf("YES\n");
return 0;
}
相关文章推荐
- Codeforces Round #189 (Div. 1)
- Codeforces Round #189 (Div. 2)
- Codeforces Round #189 (Div. 2) 解题报告
- Codeforces Round #189 (Div. 2) 解题报告
- Codeforces Round #189 (Div. 2) A. Magic Numbers
- Codeforces Round #189 (Div. 2)
- Codeforces Round #189 (Div. 1)
- Codeforces Round #189 (Div. 1) B. Psychos in a Line
- Codeforces Round #189 (Div. 2) D. Psychos in a Line 单调队列dp
- Codeforces Round #189 (Div. 2)---A. Magic Numbers
- Codeforces Round #189 (Div. 2) B
- Codeforces Round #189 (Div. 1) Kalila and Dimna in the Logging Industry 斜率DP
- Codeforces Round #189 (Div. 1) B. Psychos in a Line 单调队列
- Codeforces Round #445 (Div. 2) D - Restoration of string 思维 图论
- Codeforces Round #429 (Div. 2) ABC
- Codeforces Round #258 (Div. 2) B. Sort the Array (模拟)
- Codeforces Round #192 (Div. 2) (330A) A. Cakeminator
- Codeforces Round #149 (Div. 2) Dispute (队列+容器模拟)
- Codeforces Round #192 (Div. 2) 解题报告 //缺E
- Codeforces Round #322 (Div. 2)