超级暴力pro max

包看得懂

#include<bits/stdc++.h>
using namespace std;
int a[15];
int main(){
    int n; cin >> n;
    bool f = 0;
    for(int i = 0;i <= 9;i++){
        for(int j = 0;j <= 9;j++){
            for(int k = 0;k <= 9;k++){
                for(int l = 0;l <= 9;l++){
                    for(int q = 0;q <= 9;q++){
                        int sum = i * 10000 + j * 1000 + k * 100 + l * 10 + q;
                        if(sum % n == 0){
                        	memset(a,0,sizeof a);
                        	a[i]++,a[j]++,a[k]++,a[l]++,a[q]++;
                        	int t = sum / n;
                        	int wan = t / 10000,qian = t % 10000 / 1000,bai = t % 1000 / 100,shi = t % 100 / 10,ge = t % 10;
                        	a[wan]++,a[qian]++,a[bai]++,a[shi]++,a[ge]++;
                        	if(a[1] == 1 && a[2] == 1 && a[3] == 1 && a[4] == 1 && a[5] == 1 && a[6] == 1 && a[7] == 1 && a[8] == 1 && a[9] == 1 && a[0] == 1){
                        		cout << i << j << k << l << q << " / " << wan << qian << bai << shi << ge << endl;
                        		f = 1;
							}
						}
                    }
                }
            }
        }
    }
    if(f == 0) cout << "No answer.";
    return 0;
}

这数据仿佛有点水啊……提升点强度吧