HDU 4394Digital Square

最新推荐文章于 2019-11-26 18:27:49 发布

原创最新推荐文章于 2019-11-26 18:27:49 发布 · 1.2k 阅读

0 ·

CC 4.0 BY-SA版权

ACM 同时被 2 个专栏收录

41 篇文章

订阅专栏

搜索

22 篇文章

订阅专栏

本文深入探讨了深度学习在人工智能领域的应用，包括卷积神经网络、循环神经网络、自动推理系统等关键技术，并展示了这些技术在自动驾驶、图像处理、自然语言处理等实际场景中的应用案例。

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

Digital Square

Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)

Total Submission(s) : 10 Accepted Submission(s) : 6

Problem Description

Given an integer N,you should come up with the minimum nonnegative integer M.M meets the follow condition: M²%10^x=N (x=0,1,2,3....)

Input

The first line has an integer T( T< = 1000), the number of test cases. For each case, each line contains one integer N(0<= N <=10[sup]9[/sup]), indicating the given number.

Output

For each case output the answer if it exists, otherwise print “None”.

Sample Input

Sample Output

None
11
5

Source

2012 Multi-University Training Contest 10

简单搜索题，判断几位数相乘后对余数没有影响就好

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
using namespace std;

int t,n;
long long Mod;

struct node
{
    long long num;
    long long ten;
    friend bool operator < (node a,node b)
    {
        return a.num>b.num;
    }
} a,b;

void bfs()
{
    priority_queue<node>q;
    int num=n%10;
    for(int i=0; i<10; i++)
        if(i*i%10==num)
        {
            a.num=i;
            a.ten=10;
            q.push(a);
        }
    while(q.size())
    {
        a=q.top();
        if(a.num*a.num%Mod==n)
        {
            cout<<a.num<<endl;
            return ;
        }
        q.pop();
        for(long long i=0; i<10; i++)
        {
            b.num=a.num+i*a.ten;
            b.ten=a.ten*10;
            if(b.num*b.num%b.ten==n%b.ten)
            {
                q.push(b);
            }
        }
    }
    cout<<"None"<<endl;
    return ;
}

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        cin>>n;
        int nn=n;
        Mod=1;
        while(nn)
        {
            Mod*=10;
            nn/=10;
        }
        bfs();
    }
}