zoukankan      html  css  js  c++  java
  • 低三位的数是8的倍数就可以被8整除

    Description

    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.

    Sample Input

    Input
    3454
    Output
    YES
    344
    Input
    10
    Output
    YES
    0
    Input
    111111
    Output
    NO
    #include <iostream>
    #include <cstdio>
    #include <cstdlib>
    #include <cstring>
    
    using namespace std;
    
    string s;bool a[10];
    
    int main()
    {
        memset(a,false,sizeof a);cin>>s;
        for(int i=0;i<s.size();i++){
            if(s[i]=='0'||s[i]=='8') {puts("YES");printf("%c
    ",s[i]);return 0;}
            if(s[i]=='6'&&a[1]) {puts("YES");printf("16
    ");return 0;}
            if(s[i]=='4'&&a[2]) {puts("YES");printf("24
    ");return 0;}
            if(s[i]=='2'&&a[3]) {puts("YES");printf("32
    ");return 0;}
            if(s[i]=='6'&&a[5]) {puts("YES");printf("56
    ");return 0;}
            if(s[i]=='4'&&a[6]) {puts("YES");printf("64
    ");return 0;}
            if(s[i]=='2'&&a[7]) {puts("YES");printf("72
    ");return 0;}
            if(s[i]=='6'&&a[9]) {puts("YES");printf("96
    ");return 0;}
            a[s[i]-'0']=true;
        }
        for(int i=0;i<s.size()-2;i++)
            for(int j=i+1;j<s.size()-1;j++)
                for(int k=j+1;k<s.size();k++){
                    int num = (s[i]-'0')*100+(s[j]-'0')*10+(s[k]-'0');
                    if(num%8==0) {puts("YES");printf("%d
    ",num);return 0;}
                }
        puts("NO");
        return 0;
    }
    

      

  • 相关阅读:
    使用Index()+Match()函数实现更为灵活的VLookUp()
    Hexo搭建博客笔记
    Jenkins自动化部署项目
    Ubuntu安装docker
    Ubuntu的简单使用
    ansible之Ad-Hoc
    redis的集群
    redis的主从复制和哨兵
    redis的持久化存储
    redis数据库基础
  • 原文地址:https://www.cnblogs.com/BugClearlove/p/4703612.html
Copyright © 2011-2022 走看看