【CodeForces 550C 】Divisibility by Eight DFS 数学_you are given a non-negative integer n, its decima-CSDN博客

本文链接：https://blog.csdn.net/qq_45492531/article/details/106851890

博客介绍了如何解决CodeForces上550C题目的问题，即从一个非负整数中移除一些数字，使其能被8整除且不包含前导零。提供了使用DFS（深度优先搜索）的思路和AC（Accepted）代码。文章包含了输入输出示例和解题关键——末三位能被8整除的数学条件。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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整除，有则输出一种情况

思路：

数学条件：能被8整除的数，其末三位肯定能被8整除（n>=100）。
这样，我们就可以DFS对每个数位进行选或者不选的操作，选了就计入sum，然后看选了1、 2 、 3位的时候能否被8整除即可。时间复杂度O(n³)。具体操作见代码注释

AC代码：

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include <queue>
#include<sstream>
#include <stack>
#include <set>
#include <bitset>
#include<vector>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,n) for(int i=a;i<=n;++i)
#define per(i,n,a) for(int i=n;i>=a;--i)
#define pb push_back
#define mp make_pair
#define