题意:
给定n(1<=n<=1e17),问n的各个数位的任意排列能否被17整除,可以的话输出那个排列。
思路:
因为17的倍数在数字较大的时候十分密集,所以暴搜+剪枝会很快。
代码:
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <map>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <string>
#include <sstream>
#define pb push_back
#define X first
#define Y second
#define ALL(x) x.begin(),x.end()
#define INS(x) inserter(x,x.begin())
#define pii pair<int,int>
#define qclear(a) while(!a.empty())a.pop();
#define lowbit(x) (x&-x)
#define sd(n) scanf("%d",&n)
#define sdd(n,m) scanf("%d%d",&n,&m)
#define sddd(n,m,k) scanf("%d%d%d",&n,&m,&k)
#define mst(a,b) memset(a,b,sizeof(a))
#define cout3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl
#define cout2(x,y) cout<<x<<" "<<y<<endl
#define cout1(x) cout<<x<<endl
#define IOS std::ios::sync_with_stdio(false)
#define SRAND srand((unsigned int)(time(0)))
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
using namespace std;
const double PI=acos(-1.0);
const int INF=0x3f3f3f3f;
const ll mod=1000000007;
const double eps=1e-8;
const int maxn=100005;
const int maxm=10005;
char num[20];
char ans[20];
bool vis[20];
int len;
bool ok=0;
void dfs(int cnt){
if(cnt==len){
ll n;
n=0;
for(int i=0;i<len;i++){
n=n*10+(ans[i]-'0');
}
if(n%17==0){
ok=1;
return ;
}
}
for(int i=0;i<len;i++){
if(vis[i]||(cnt==0&&num[i]=='0'))continue;
vis[i]=1;
ans[cnt]=num[i];
dfs(cnt+1);
if(ok)return ;
vis[i]=0;
while(i+1<len&&num[i]==num[i+1])i++;
}
return ;
}
void solve() {
scanf("%s",num);
len=strlen(num);
dfs(0);
if(ok){
printf("%s\n",ans);
}else{
printf("-1\n");
}
return ;
}
int main() {
#ifdef LOCAL
freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
#else
// freopen("","r",stdin);
// freopen("","w",stdout);
#endif
solve();
return 0;
}