Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Perfect Pth Powers
Description We say that x is a perfect square if, for some integer b, x = b ^{2}. Similarly, x is a perfect cube if, for some integer b, x = b^{3}. More generally, x is a perfect pth power if, for some integer b, x = b^{p}. Given an integer x you are to determine the largest p such that x is a perfect pth power. Input Each test case is given by a line of input containing x. The value of x will have magnitude at least 2 and be within the range of a (32-bit) int in C, C++, and Java. A line containing 0 follows the last test case. Output For each test case, output a line giving the largest integer p such that x is a perfect p th power.Sample Input 17 1073741824 25 0 Sample Output 1 30 2 Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator