C. Divisibility by Eight
2015-08-22 21:30
274 查看
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given a non-negative integer n, its decimal representation consists of at most 100 digits
and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove any digit at all) so that the result contains at least one digit, forms a non-negative integer, doesn't have leading zeroes and is divisible by 8. After
the removing, it is forbidden to rearrange the digits.
If a solution exists, you should print it.
Input
The single line of the input contains a non-negative integer n. The representation of number n doesn't
contain any leading zeroes and its length doesn't exceed 100 digits.
Output
Print "NO" (without quotes), if there is no such way to remove some digits from number n.
Otherwise, print "YES" in the first line and the resulting number after removing digits from number n in
the second line. The printed number must be divisible by 8.
If there are multiple possible answers, you may print any of them.
Sample test(s)
input
output
input
output
input
output
解题说明:此题可以通过穷举暴力来做,三层循环判断。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
string s;
int main()
{
cin >> s;
s = "00" + s;
for (int i = 0; i < s.length(); i++)
{
for (int j = i+1; j < s.length(); j++)
{
for (int k = j+1; k < s.length(); k++)
{
int x = 100*(s[i]-'0') + 10*(s[j]-'0') + s[k]-'0';
if (x % 8 == 0)
{
cout << "YES\n" << x << endl;
return 0;
}
}
}
}
cout << "NO"<<endl;
}
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
You are given a non-negative integer n, its decimal representation consists of at most 100 digits
and doesn't contain leading zeroes.
Your task is to determine if it is possible in this case to remove some of the digits (possibly not remove any digit at all) so that the result contains at least one digit, forms a non-negative integer, doesn't have leading zeroes and is divisible by 8. After
the removing, it is forbidden to rearrange the digits.
If a solution exists, you should print it.
Input
The single line of the input contains a non-negative integer n. The representation of number n doesn't
contain any leading zeroes and its length doesn't exceed 100 digits.
Output
Print "NO" (without quotes), if there is no such way to remove some digits from number n.
Otherwise, print "YES" in the first line and the resulting number after removing digits from number n in
the second line. The printed number must be divisible by 8.
If there are multiple possible answers, you may print any of them.
Sample test(s)
input
3454
output
YES 344
input
10
output
YES 0
input
111111
output
NO
解题说明:此题可以通过穷举暴力来做,三层循环判断。
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
string s;
int main()
{
cin >> s;
s = "00" + s;
for (int i = 0; i < s.length(); i++)
{
for (int j = i+1; j < s.length(); j++)
{
for (int k = j+1; k < s.length(); k++)
{
int x = 100*(s[i]-'0') + 10*(s[j]-'0') + s[k]-'0';
if (x % 8 == 0)
{
cout << "YES\n" << x << endl;
return 0;
}
}
}
}
cout << "NO"<<endl;
}
相关文章推荐
- python学习 3
- hdu 1239 Calling Extraterrestrial Intelligence Again
- 静态动态数组
- iOS_17_控制开关_TabBarController_由storyboard道路
- Sumdiv(快速幂+约数和)
- linux下配置jdk环境变量的三种方法
- MAC 系统升级10.10以后PHP验证码错误的解决办法。[ 一行代码轻松解决! ]
- Sumdiv(快速幂+约数和)
- 终于有人把“约炮经济学”讲清楚了
- OpenGL之坐标转换(好文-清晰版)
- storm shuffleGrouping随机分组
- 位图文件存储空间的计算
- 找出二叉查找树中指定结点的”下一个"结点(也即中序后继)
- 数组复制的误区
- [LeetCode][JavaScript]Ugly Number II
- 【软工5】:软件工程的发展和体系结构
- 【软工5】:软件工程的发展和体系结构
- Android Api Demos登顶之路(四十四)Launcher Shortcuts
- 封装RabbitMQ.NET Library 的一点经验总结
- R语言之文本挖掘