C. Divisibility by Eight
来源:互联网 发布:淘宝王子 删除中差评 编辑:程序博客网 时间:2024/05/16 10:58
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.
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.
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.
3454
YES344
10
YES0
111111
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;}
- C. Divisibility by Eight
- CF C. Divisibility by Eight
- CODEFORCES 550 C. Divisibility by Eight
- codeforces 550C Divisibility by Eight(数学题)
- 550C Divisibility by Eight(还是枚举)
- CodeForces 550C Divisibility by Eight(枚举)
- Codeforces 550 C. Divisibility by Eight
- codeforce 550c Divisibility by Eight (DFS)
- 【codeforces 550C】Divisibility by Eight
- cf 550c Divisibility by Eight 【规律】
- Divisibility by Eight
- Codeforces550C:Divisibility by Eight
- Divisibility by Eight
- Divisibility by Eight
- Codeforces Divisibility by Eight
- Codeforces Round #306 (Div. 2)C. Divisibility by Eight--模拟
- Codeforces Round #306 (Div. 2) C.Divisibility by Eight
- CF#306-C - Divisibility by Eight-数学+暴力
- OpenGL之坐标转换(好文-清晰版)
- storm shuffleGrouping随机分组
- Android Api Demos登顶之路(四十四)Launcher Shortcuts
- HDU 1035.Robot Motion【还是模拟】【8月22】
- 图论 - hdu5348 MZL's endless loop
- C. Divisibility by Eight
- Linux下搭建python + nodejs + express环境
- Sumdiv(快速幂+约数和)
- python学习 3
- 如何选择mysql的存储引擎
- hdu 1239 Calling Extraterrestrial Intelligence Again
- 静态动态数组
- sleep() wait() yeild()三者之间的区别?
- 定时器的配置与例子