Codeforces 550C. Divisibility by Eight

C. Divisibility by Eight

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.

Examples

input

Copy

3454

output

Copy

YES
344

input

Copy

10

output

Copy

YES
0

input

Copy

111111

output

Copy

NO

题意：给定一个长度不超过100的数字字符串（不含前导0），问如果移除了其中的若干位，会不会使得移除后的数能够整除8

方法：由于1000能够被8整除，所以超过1000的数只要考虑末三位就行，预处理0~999的所有能被8整除的数，按顺序暴力枚举三位，一位、两位、三位都要单独判断一下，保存结果

代码：

#include<cstdio>
#include<cstring>
using namespace std;
int mark[1100];
int main()
{
    char s[110];
    scanf("%s",s);
    int len = strlen(s);
    for(int i = 0; i < 1000; i++)
    {
        if(i % 8 == 0)
            mark[i] = 1;
    }
    int flag = 0,res;
    for(int i = 0; i < len; i++)
    {
        int a = s[i] - '0';
        if(a == 8)
        {
            flag = 1;
            res = 8;
            break;
        }
        else if(a == 0)
        {
            flag = 1;
            res = 0;
            break;
        }
        for(int j = i + 1; j < len; j++)
        {
            int b = s[j] - '0';
            if(b == 8)
            {
                flag = 1;
                res = 8;
                break;
            }
            else if(b == 0)
            {
                flag = 1;
                res = 0;
                break;
            }
            else if((a * 10 + b) % 8 == 0)
            {
                flag = 1;
                res = a * 10 + b;
                break;
            }
            for(int k = j + 1; k < len; k++)
            {
                int c = s[k] - '0';
                if((a * 10 + c) % 8 == 0)
                {
                    flag = 1;
                    res = a * 10 + c;
                    break;
                }
                else if((b * 10 + c) % 8 == 0)
                {
                    flag = 1;
                    res = b * 10 + c;
                    break;
                }
                else if((a * 100 + b * 10 + c) % 8 == 0)
                {
                    flag = 1;
                    res = a * 100 + b * 10 + c;
                    break;
                }
            }
            if(flag)
                break;
        }
        if(flag)
            break;
    }
    if(flag)
    {
        printf("%YES\n");
        printf("%d\n",res);
    }

    else
        printf("NO\n");
    return 0;
}