UVA 725 DFS

最新推荐文章于 2021-02-21 08:40:51 发布

ajsdfkjasdfasdif

最新推荐文章于 2021-02-21 08:40:51 发布

阅读量391

点赞数

CC 4.0 BY-SA版权

分类专栏： ----------搜索--------

本文链接：https://blog.youkuaiyun.com/qq_32454729/article/details/52294580

----------搜索-------- 专栏收录该内容

29 篇文章

订阅专栏

该博客探讨了如何解决UVA 725编程挑战，通过深度优先搜索（DFS）算法寻找所有使用0到9这10个数字组成的5位数对，其中94736除以01528等于62。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Division

Time Limit: 3000MS

64bit IO Format: %lld & %llu

Write a program that finds and displays all pairs of 5-digit numbers that between them use the digits 0

through 9 once each, such that the first number divided by the second is equal to an integer N, where
2 ≤ N ≤ 79. That is,
abcde
fghij = N
where each letter represents a different digit. The first digit of one of the numerals is allowed to be
zero.
Input
Each line of the input file consists of a valid integer N. An input of zero is to terminate the program.
Output
Your program have to display ALL qualifying pairs of numerals, sorted by increasing numerator (and,
of course, denominator).
Your output should be in the following general form:
xxxxx / xxxxx = N
xxxxx / xxxxx = N
.
.
In case there are no pairs of numerals satisfying the condition, you must write ‘There are no
solutions for N.’. Separate the output for two different values of N by a blank line.
Sample Input
61
62
0
Sample Output
There are no solutions for 61.
79546 / 01283 = 62

94736 / 01528 = 62

简单DFS搜索

#include"stdio.h"
#include"queue"
#include"iostream"
#include"map"
#include"cstring"
using namespace std;
typedef long long ll;
int flag;
int n;
int visit[20];
int b[6];
int a[6];
bool check(int n)
{
    if(n>99999) return false; //出界
    memset(a,0,sizeof(a));
    int cur=5;
    map<int,int>cnt;
    while(n)
    {
       a[cur--]=n%10;n/=10;
    }
    for(int i=1;i<=5;i++)
    {
        if(cnt[a[i]]==0) cnt[a[i]]++;
        else return false;
    }
    for(int i=1;i<=5;i++)
    {
        if(cnt[b[i]]==0) cnt[b[i]]++;
        else return false;
    }
    return true;

}
void dfs(int num,int dep)
{
    if(dep==5)
    {
        if(check(num*n))
        {
            flag=1;
            for(int i=1;i<=5;i++) cout<<a[i];
            cout<<" / ";
            for(int i=1;i<=5;i++) cout<<b[i];
            cout<<" = "<<n<<endl;
        }
        return ;
    }

    for(int i=0;i<=9;i++)
        if(!visit[i])
        {
            b[dep+1]=i;
            visit[i]=1;
            dfs(num*10+i,dep+1);
            visit[i]=0;
        }
}
int main()
{

    int first=1;
    while(cin>>n,n)
    {
        first?first=0:puts("");
        memset(visit,0,sizeof(visit));
        flag=0;
        for(int i=0;i<=9;i++)
        {
            if(!visit[i])
            {
                b[1]=i;
                visit[i]=1;
                dfs(i,1);
                visit[i]=0;
            }
        }

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