Divisibility by Eight

关注

原创最新推荐文章于 2026-05-24 09:58:24 发布 424 阅读 AI 写同款· GEO 优化 ›

AFE芯片做什么用的？AFE（Analog Front End）模拟前端 AFE采样精度的影响因素非常多，需要综合考虑各种因素，并根据实际应用场景来选择合适的参数和方法。通过减少噪声、提高采样频率、调节放大器增益、降低电源噪声、优化传输线路、进行温度补偿、选择合适的ADC分辨率、根据信号类型选择合适的AFE参数、进行器件匹配和校准等方法，可以提高AFE的采样精度，从而更好地满足各种应用需求。版权声明：本文为优快云博主「czf.Forver」的原创文章，遵循CC 4.0 BY-SA版权协议，转载请附上原文出处链接及本声明。阅读详情

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 test(s)

input
3454

output
YES
344

input
10

output
YES
0

input
111111

output
NO

一个100位以下的数，能否通过删除一些字符使其能被8整除。听说有人打表过，因为被8整除的数只需要后三位被8整除即可。因为大于1000的部分一定可以用8的倍数表示。

因此这个数是否被8整除取决于后三位。一共124个，打表找。我想可以一个一个找，一共才100位，并不会超时，一开始也可以通过找0和8来剪枝。然后分2位和3位来找。

#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
char c[105];
int leap1[105], leap2[105], leap3, pre, sum;
int main()
{
int i, j, m, n, len, leap, k;
scanf("%s",c);
memset(leap1, 0, sizeof(leap1));
memset(leap2, 0, sizeof(leap2));
len = strlen(c); leap = 0; leap3 = 0;
for (i = 0; i < len; i++)
{
  if (c[i] == '0')
  {
   leap = 1;
  }
}
if (leap == 1)
  cout << "YES" << endl << "0" << endl;
else
{
  for (i = 0; i < len; i++)
  {
   if (c[i] == '8')
   {
    leap = 1;
   }
  }
  if (leap == 1)
   cout << "YES" << endl << "8" << endl;
  else
  {
   for (i = 0; i < len; i++)
   {
    for (j = i + 1; j < len; j++)
    {
     if (((c[i] - '0') * 10 + (c[j] - '0')) % 8 == 0)
     {
      cout << "YES" << endl << c[i] << c[j] << endl;
      leap = 1;
      break;
     }
    }
    if (leap == 1)break;
   }
   if (!leap){
    for (i = 0; i < len; i++)
    {
     for (j = i+1; j < len; j++)
     {
      for (k = j+1; k < len; k++)
      {
       if (((c[i] - '0') * 100 + (c[j] - '0') * 10 + (c[k] - '0')) % 8 == 0)
       {
        cout << "YES" << endl << c[i] << c[j] << c[k] << endl;
        leap = 1;
        break;
       }
      }
      if (leap == 1)break;
     }
     if (leap == 1)break;
    }
   }
   if (leap == 0)cout << "NO" << endl;
  }
}
return 0;
}