U - Divisibility by Eight()

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.

Examples
Input
3454
Output
YES
344
Input``
10
Output
YES
0
Input
111111
Output
NO

题目大意:如果这个串,再不改变字符顺序的前提下,可以删除,也可以不删除,问能不能整除8?可以只看个位,或者百位等等,只要能输出就行。要是都不满足,就输出no
拿到题就在想,我先一位一位的看之后再看两位的。。。。
但搜了下说,数学结论:只要尾部三位数能整整除8,那么这个多位数就算满足题意

所以我就单独看一位两位三位

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iomanip>
using namespace std;
int main()
{
	
	char s[1000]; cin >> s;//没用字符串s用的字符数组;
	int l = strlen(s);
	for (int i = 0; i < l; i++)
	{
		int a = s[i] - '0';
		if (a % 8 == 0)
		{
			cout << "YES" << endl << a; return 0;
		}
	}
	for (int i = 0; i < l - 1; i++)
	{
		for (int j = i + 0; j < l; j++)
		{
			int a = s[i] - '0'; int b = s[j] - '0';
			int m = a * 10 + b;
			if (m % 8 == 0)
			{
				cout << "YES" << endl << m;return 0;
			}
		}
	}
	for(int i=0;i<l-2;i++)
		for(int j=i+1;j<l-1;j++)
			for (int k = j + 1; k < l; k++)
			{
				int a = s[i] - '0'; int b = s[j] - '0'; int c = s[k] - '0';
				int m = a * 100 + b * 10 + c;
				if (m % 8 == 0)
				{
					cout << "YES" << endl << m; return 0;
				}
			}
			cout << "NO";
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值