UVa 725 除法

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=666

题意：输入正整数n，按从小到大的顺序输出所有形如abcde/fghij=n的表达式，其中a~j恰好为数字0~9的一个排列。

思路：暴力求解，从1234开始一直到50000检验一遍即可。

#include<iostream>
#include<iomanip>
#include<cstring>
using namespace std;

int tot;
int n;
int used[10];
int kase = 0;


bool judge(int ans, int z)
{
    memset(used, 0, sizeof(used));
    for (int i = 0; i < 5; i++)
    {
        used[ans % 10] = 1;
        used[z % 10] = 1;
        z /= 10;
        ans /= 10;
    }
    int sum = 0;
    for (int i = 0; i < 10; i++)
        sum += used[i];
    if (sum == 10)
    {
        tot++;
        return true;
    }
    return false;
}

void print_ans(int ans ,int z)
{
    if (z> 98765) return;
    if (judge(ans, z))
    {
        //printf("%05d / %05d = %d
", z, ans, n);
        cout << setfill('0') << setw(5) << z << " / " << setfill('0') << setw(5) << ans << " = " << n << endl;
    }
}

void solve()
{
    for (int i = 1234; i <= 50000; i++)
    {
        int z = i*n;
        print_ans(i, z);
    }
}

int main()
{
    while (cin >> n && n)
    {    
        if(kase++)  cout<<endl;
        memset(visited, 0, sizeof(visited));
        tot = 0;
        solve();
        if (tot == 0)
        {
            cout << "There are no solutions for " << n << "." << endl;
        }
    }
    return 0;
}