Codeforces 550 C. Divisibility by Eight
来源:互联网 发布:二战江河级护卫舰数据 编辑:程序博客网 时间:2024/05/21 15:49
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
题目大意:就是给你一个字符串,让你去掉其中的几个数,看是否能被8整除
解题思路:就是暴力解决,如果能被8整除,只需要看最后三位数就行
上代码:
/*Date : 2015-09-04 晚上Author : ITAKINGMotto :今日的我要超越昨日的我,明日的我要胜过今日的我;以创作出更好的代码为目标,不断地超越自己。*/#include <iostream>#include <cstdio>#include <cstring>using namespace std;char str[105];int main(){ while(cin>>str+2) { str[0] = str[1] ='0'; int len = strlen(str), ret; bool flag = false; for(int i=0; i<len-2; i++) { if(flag) break; for(int j=i+1; j<len-1; j++) { if(flag) break; for(int k=j+1; k<len; k++) { ret = (str[i]-'0')*100+(str[j]-'0')*10+str[k]-'0'; if(ret%8 == 0) { flag = true; break; } } } } if(flag) printf("YES\n%d\n",ret); else puts("NO"); } return 0;}
- CODEFORCES 550 C. Divisibility by Eight
- codeforces 550C Divisibility by Eight(数学题)
- CodeForces 550C Divisibility by Eight(枚举)
- Codeforces 550 C. Divisibility by Eight
- 【codeforces 550C】Divisibility by Eight
- CodeForces 550C Divisibility by Eight 数学 枚举
- CodeForces 550C Divisibility by Eight (规律,暴力)
- codeforces 550C Divisibility by Eight (暴力)
- Codeforces Divisibility by Eight
- C. Divisibility by Eight
- 550C Divisibility by Eight(还是枚举)
- codeforce 550c Divisibility by Eight (DFS)
- cf 550c Divisibility by Eight 【规律】
- Codeforces Round #306 (Div. 2)C. Divisibility by Eight--模拟
- Codeforces Round #306 (Div. 2) C.Divisibility by Eight
- codeforces #306 550C C. Divisibility by Eight(同余模定理+枚举)
- CF C. Divisibility by Eight
- CodeForces 550C Divisibility by Eight 简单题算是找规律?
- Windows7 x64系统下安装Nodejs并在WebStorm 9.0.1下搭建编译less环境
- usaco Cow Tours
- 网易游戏2016实习生招聘笔试题目--推箱子
- ping结果中TTL是什么意思
- HDU 4704 SUM 整数快速幂+费马小定理
- Codeforces 550 C. Divisibility by Eight
- PipelineStudio v3.6.1.0 Final-ISO 1CD(稳定版,化工管道仿真技术)
- 并发(Concurrent)与并行(Parallel)的区别
- Schlumberger.OilField.Manager.V2014.1(OFM)油田日常监控和管理软件包
- 神经网络的cost function
- QT编写记事本
- 线段树
- Aspen Technology AspenONE Suite v8.8 Win7_8-ISO 3DVD(完全解密版,包括DVD1和DVD2)
- mac手动删除MySQL