Problem 3006 --Minimal Power of Prime

3006: Minimal Power of Prime

"
Time Limit $1$ 秒/Second(s) Memory Limit $512$ 兆字节/Megabyte(s)
提交总数 $2$ 正确数量 $2$
裁判形式 标准裁判/Standard Judge 我的状态 尚未尝试
难度 分类标签
You are given a positive integer n > 1. Consider all the different prime divisors of n. Each of them is included in the expansion n into prime factors in some degree. Required to find among the indicators of these powers is minimal.
The first line of the input file is given a positive integer T ≤ 50000, number of positive integers n in the file. In the next T line sets these numbers themselves. It is guaranteed that each of them does not exceed 10^18.
For each positive integer n from an input file output in a separate line a minimum degree of occurrence of a prime in the decomposition of n into simple factors.
5
2
12
108
36
65536
1
1
2
2
16

推荐代码 查看3006 所有题解 上传题解视频得图灵币

本题记录 用 户(点击查看用户) 运行号(点击购买题解) 时 间
算法最快[$295 $ms] intLSY 475248 2019-09-27 21:16:09
内存最少[$1440 $KB] 淡意的温柔 590707 2020-06-05 08:36:59
第一AC intLSY 475248 2019-09-27 21:16:09
第一挑战 intLSY 475248 2019-09-27 21:16:09

赛题来源/所属竞赛 2019 Multi-University Training Contest 4 N/A

竞赛编号 竞赛名称 竞赛时间 访问比赛