zoukankan      html  css  js  c++  java
  • Codeforces550C(SummerTrainingDay01-H)

    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

    3454

    output

    YES
    344

    input

    10

    output

    YES
    0

    input

    111111

    output

    NO


     1 //2017-08-01
     2 #include <cstdio>
     3 #include <iostream>
     4 #include <cstring>
     5 #include <algorithm>
     6 
     7 using namespace std;
     8 
     9 const int N = 110;
    10 char num[N];
    11 
    12 int main()
    13 {
    14     while (scanf("%s", num) != EOF)
    15     {
    16         int n = strlen(num);
    17         bool fg = false;
    18         for (int i = 0; i < n; i++)
    19         {
    20             if (num[i] == '0')
    21             {
    22                 fg = true;
    23                 printf("YES
    0
    ");
    24                 break;
    25             }
    26         }
    27         if(fg)continue;
    28         for (int a = 8; a < 1000; a += 8)
    29         {
    30             int tmp = a;
    31             for (int i = n - 1; i >= 0; i--)
    32             {
    33                 if (num[i] - '0' == tmp % 10)
    34                 {
    35                     tmp /= 10;
    36                 }
    37             }
    38             if (!tmp && !fg)
    39             {
    40                 printf("YES
    %d
    ", a);
    41                 fg = true;
    42                 break;
    43             }
    44         }
    45         if (!fg)
    46             printf("NO
    ");
    47     }
    48 
    49     return 0;
    50 }
  • 相关阅读:
    oracle 查询表空间
    oracle 创建表空间
    webservice SOA
    WCF初识
    win10远程桌面身份验证错误,要求的函数不受支持
    一台主机两台显示器实现方式学习
    实现Http Server学习
    lucene索引和查询文件系统存储
    java 大文件输入方式FileOutputStream
    tar
  • 原文地址:https://www.cnblogs.com/Penn000/p/7271975.html
Copyright © 2011-2022 走看看