zoukankan      html  css  js  c++  java
  • HDU5505

    GT and numbers

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
    Total Submission(s): 1803    Accepted Submission(s): 482

    Problem Description

    You are given two numbers N and M.

    Every step you can get a new N in the way that multiply N by a factor of N.

    Work out how many steps can N be equal to M at least.

    If N can't be to M forever,print 1.
     

    Input

    In the first line there is a number T.T is the test number.

    In the next T lines there are two numbers N and M.

    T10001N1000000,1M263.

    Be careful to the range of M.

    You'd better print the enter in the last line when you hack others.

    You'd better not print space in the last of each line when you hack others.
     

    Output

    For each test case,output an answer.
     

    Sample Input

    3
    1 1
    1 2
    2 4
     

    Sample Output

    0
    -1
    1
     
     1 //2016.8.17
     2 #include<iostream>
     3 #include<cstdio>
     4 #define ll unsigned long long
     5 using namespace std;
     6 
     7 ll gcd(ll a, ll b)
     8 {
     9     return b==0?a:gcd(b, a%b);
    10 }
    11 
    12 int main()
    13 {
    14     int T, cnt;
    15     bool fg;
    16     ll n, m;
    17     cin>>T;
    18     while(T--)
    19     {
    20         scanf("%I64d%I64d", &n, &m);
    21         if(n==m){
    22             puts("0");
    23             continue;
    24         }
    25         if(n==0||m<n||m%n!=0)
    26         {
    27             puts("-1");
    28             continue;
    29         }
    30         fg = true; cnt = 0;
    31         while(m != n)
    32         {
    33             ll tmp = gcd(n, m/n);
    34             if(tmp == 1){
    35                 fg = false;
    36                 break;
    37             }
    38             n *= tmp;
    39             cnt++;
    40         }
    41         if(fg)
    42             printf("%d
    ", cnt);
    43         else 
    44               printf("-1
    ");
    45     }
    46 
    47     return 0;
    48 }
  • 相关阅读:
    windows环境下安装mysql5.7.20
    一次完成对多个子节点的全部父级节点查询
    更新数据库中值为拼接字符串的字段
    根据父节点编号查询子节点名称,孙节点个数
    Java文件流下载并提示文件不存在
    Nginx 反向代理Tomcat服务器获取真实IP问题
    Tomcat启动堆栈异常
    转一些思想 代码大全的
    一些方案
    UML建模工具
  • 原文地址:https://www.cnblogs.com/Penn000/p/5785041.html
Copyright © 2011-2022 走看看