UVa 725 Division（例题7-1）

按照书上的思路枚举fghij即可

代码

<span style="font-size:14px;">#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,tmp[1000],num[15],flag = 1,yes = 0;
void solve()
{
yes = 0;
for(int i = 1000;i*n<=99999;i++)
{
flag = 1;
//num[10] = 1;
memset(num,0,sizeof(num));
int a = i;
int b = i*n;
while(a>0)
{
num[a%10]++;
a /= 10;
}
while(b>0)
{
num[b%10]++;
b /= 10;
}
for(int j=1;j<=9;j++)
{
if(num[j] != 1 )
{
flag = 0;
break;
}

}
//cout<<i<<" "<<flag<<endl;
if(flag==1)
{
yes = 1;
if(i>9999) cout<<i*n<<" / "<<i<<" = " <<n<<endl;
if(i<=9999) cout<<i*n<<" / 0"<<i<<" = " <<n<<endl;
}
}

if(yes==0)
cout<<"There are no solutions for "<<n<<"."<<endl;
}

int main()
{
//freopen("std.in","r",stdin);
//freopen("std.out","w",stdout);
int t = 0;
while(cin>>n&&n)
{
if(t++) cout<<endl;
solve();
}
return 0;
}</span>