FZU 1895

FZU 1895 整除45的问题

先考虑末位，要能被45整除，那么肯定能被5和9整除，被5整除，末位定是0和5，被9整除，所有数字之和是9的倍数

抓住这两点，DFS一边即可，注意剪枝

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
const int N = 1005;
const int M = 15;
const int dir[5]= {0,5};
int tmp, rec[M], cnt[M];
int n, s[N], x, id;
bool flag;
char ans[N];
bool cmp(char *a, char *b) 
{
	for(int i=0; a[i]; i++) 
	{
		if(a[i]!=b[i]) return a[i]<b[i];
	}
	return false;
}
void dfs(int m, int d, int sum) 
{
	if(d>=m) 
	{
		if((sum-tmp)%9 == 0)	
		{
			char now[N];
			int len = 0;
			for(int i=9; i>=0; i--) 
			{
				for(int j = 0; j < cnt[i]; j++)
					now[len++] = i + '0';
			}
			now[len++] = dir[id] + '0';
			now[len] = '\0';
			if(m < x || (cmp(ans, now) && m == x)) 
			{
				flag = true;
				x = m;
				strcpy(ans, now);
			}
		}
		return;
	}
	for(int i = 1; i <= 8; i++) 
	{
		if(!cnt[i]) continue;
		cnt[i]--;
		dfs(m, d+1, sum+i);
		cnt[i]++;
	}
}
bool isOK(char *str) 
{
	int sum = 0, len = strlen(str);
	if(len == 0 && rec[0] == 0) return false;
	for(int i=0; i<len; i++)
		sum += str[i] - '0';
	return !sum;
}
int main() 
{
	int cas;
	scanf("%d", &cas);
	for(int i=1; i<=cas; i++) 
	{
		char num[N];
		scanf("%s", num);
		x = strlen(num), tmp = 0;
		flag = false;
		memset(rec, 0, sizeof(rec));
		memset(ans, 0, sizeof(ans));
		for(int i=0; i<x; i++) 
		{
			int cur = num[i] - '0';
			tmp += cur;
			rec[cur]++;
		}
		for(int i=0; i<2; i++) 
		{
			memcpy(cnt, rec, sizeof(rec));
			cnt[dir[i]]--;
			if (cnt[dir[i]] < 0) continue;
			id = i;
			for(int j=0; j<=tmp && j<=x; j++)
				dfs(j, 0, 0);
		}
		if(isOK(ans)) printf("0\n");
		else if (flag) puts(ans);
		else printf("impossible\n");
		}
	return 0;
}