用next_permutation枚举排列
![](https://i-blog.csdnimg.cn/blog_migrate/8f900a89c6347c561fdf2122f13be562.gif)
![](https://i-blog.csdnimg.cn/blog_migrate/961ddebeb323a10fe0623af514929fc1.gif)
//#pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> #include<iostream> #include<sstream> #include<cmath> #include<climits> #include<string> #include<map> #include<queue> #include<vector> #include<stack> #include<set> using namespace std; typedef long long ll; typedef pair<int,int> pii; #define pb(a) push_back(a) #define INF 0x1f1f1f1f #define lson idx<<1,l,mid #define rson idx<<1|1,mid+1,r #define PI 3.1415926535898 template<class T> T min(const T& a,const T& b,const T& c) { return min(min(a,b),min(a,c)); } template<class T> T max(const T& a,const T& b,const T& c) { return max(max(a,b),max(a,c)); } #define clr0(a) memset(a,0,sizeof(a)) #define clr1(a) memset(a,-1,sizeof(a)) void debug(){ #ifdef ONLINE_JUDGE #else freopen("d:\\in.txt","r",stdin); // freopen("d:\\out1.txt","w",stdout); #endif } int getch() { char ch; // while((ch=getchar())!=EOF) // { // if(ch!=' '&&ch!='\n')return ch; // } scanf(" %c",&ch); return ch; } int ans[10]; int x; int main() { int t; scanf("%d",&t); for(int ca=1;ca<=t;ca++) { for(int i=0;i<8;i++) scanf("%d",&ans[i]); int x;scanf("%d",&x); sort(ans,ans+8); int flag=0; do { int sum=0; if(ans[0]==0)continue; for(int i=7,k=1;i>=0;i--,k*=10) { sum+=k*ans[i]; } if(sum%x==0) { flag=1; break; } }while(next_permutation(ans,ans+8)); printf("%s\n",flag?"Yes":"No"); } return 0; }