(LightOJ 1220)Mysterious Bacteria

最新推荐文章于 2020-11-18 19:50:50 发布

your_own_name

最新推荐文章于 2020-11-18 19:50:50 发布

阅读量630

点赞数

分类专栏：数论

本文链接：https://blog.csdn.net/your_own_name/article/details/50831699

版权

数论专栏收录该内容

11 篇文章 0 订阅

订阅专栏

http://lightoj.com/volume_showproblem.php?problem=1220

Mysterious Bacteria

Time Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %llu

Description

Dr. Mob has just discovered a Deathly Bacteria. He named it RC-01. RC-01 has a very strange reproduction system. RC-01 lives exactlyx days. Now RC-01 produces exactlyp new deadly Bacteria wherex = b^p (whereb, p are integers). More generally,x is a perfectp^th power. Given the lifetimex of a mother RC-01 you are to determine the maximum number of new RC-01 which can be produced by the mother RC-01.

Input

Input starts with an integerT (≤ 50), denoting the number of test cases.

Each case starts with a line containing an integerx. You can assume thatx will have magnitude at least 2 and be within the range of a 32 bit signed integer.

Output

For each case, print the case number and the largest integerp such thatx is a perfectp^th power.

Sample Input

1073741824

Sample Output

Case 1: 1

Case 2: 30

Case 3: 2

题意：

给一个整数x,求满足x = b^p(均为整数)条件的最大p值

则求出x=a1^p1 *a2^p2*a3^p3……an^pn

其中a1……an均为素数

然后求ans = gcd(p1,p2,……，pn);

有一个坑，就是n可能为负数，这时，ans必须为奇数……

^Code

#include 
     
     
      
      
#include 
      
      
       
       
#include 
       
       
        
        
#include 
        
        
         
         
#include 
         
         
           #include 
          
            #include 
           
             #include 
            
              #include 
              #include 
              
                #include 
               
                 #include 
                
                  #include 
                 
                   #define maxn (1000000 + 10) #define pi acos(-1.0) using namespace std; typedef long long int LLI; bool mark[maxn + 10]; LLI isprime[maxn + 10],p = 0; vector 
                  
                    Vec; LLI gcd(LLI a, LLI b) { return b == 0 ? a : gcd(b, a % b); } void sieve_prime() { memset(mark, true, sizeof(mark)); mark[0] = mark[1] = false; for (LLI i = 2; i * i <= maxn; i++) if (mark[i]) for (LLI j = i * i; j < maxn; j = j + i) mark[j] = false; } bool Solve(LLI n) { for(LLI i = 0; i < p && isprime[i] * isprime[i] <= n; i ++) { LLI temp = 0; while(n % isprime[i] == 0) { temp ++; n = n / isprime[i]; } if(temp != 0) Vec.push_back(temp); } if(n > 1) return false; else return true; } int main() { // freopen("in.txt","r",stdin); // freopen("out.txt","w",stdout); sieve_prime(); for(LLI i = 0; i <= maxn; i ++) if(mark[i]) isprime[p ++] = i; LLI t,n; scanf("%lld",&t); for(LLI Case = 1; Case <= t; Case ++) { int op = 0; scanf("%lld",&n); if(n < 0) n = -n,op = 1; bool flag = Solve(n); if(!flag) printf("Case %lld: 1\n",Case); else { LLI ans = Vec[0]; for(LLI i = 1; i < Vec.size(); i ++) ans = gcd(ans,Vec[i]); if(op == 1) while(ans % 2 == 0) ans = ans / 2; printf("Case %lld: %lld\n",Case,ans); } Vec.clear(); } return 0; }

your_own_name

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
(LightOJ 1220)Mysterious Bacteria

http://lightoj.com/volume_showproblem.php?problem=1220Mysterious BacteriaTime Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %lluDescription Dr. Mob has just discov
复制链接

扫一扫