UVA - 725 Division C++

题目:https://odzkskevi.qnssl.com/8b9d8bb43198f28efe782047d56ab361?v=1532305203

思路:

果然……很暴力。

用紫书上说的枚举fghij,然后算出abcde,然后去判断。

代码:

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main()
{
    int n,t=0;
    while(scanf("%d",&n)!=EOF&&n)
    {
        if(t++)cout<<endl;
        int flag=0;
        for(int i=1234;i<50000;i++)
        {
            int a=i,b=a*n;
            if(b>98765)continue;
            int vis[10];
            memset(vis,0,sizeof(vis));
            if(a<10000)vis[0]=1;
            while(a)
            {
                vis[a%10]=1;
                a/=10;
            }
            while(b)
            {
                vis[b%10]=1;
                b/=10;
            }
            int k=0;
            for(;k<10;k++)
            {
                if(!vis[k])break;
            }
            if(k==10)
            {
                flag=1;
                printf("%05d / %05d = %d\n",i*n,i,n);
            }
        }
        if(flag==0)printf("There are no solutions for %d.\n",n);
    }
    return 0;
}

猜你喜欢

转载自blog.csdn.net/zero_979/article/details/81169655
今日推荐