分解质因数之codeforces_588B
来源:互联网 发布:linux 原生 迅雷 64 编辑:程序博客网 时间:2024/06/11 21:50
Description
Duff is in love with lovely numbers! A positive integer x is called lovely if and only if there is no such positive integer a > 1 such that a2 is a divisor of x.
Malek has a number store! In his store, he has only divisors of positive integer n (and he has all of them). As a birthday present, Malek wants to give her a lovely number from his store. He wants this number to be as big as possible.
Malek always had issues in math, so he asked for your help. Please tell him what is the biggest lovely number in his store.
Input
The first and only line of input contains one integer, n (1 ≤ n ≤ 1012).
Output
Print the answer in one line.
Sample Input
10
10
12
6
Hint
In first sample case, there are numbers 1, 2, 5 and 10 in the shop. 10 isn't divisible by any perfect square, so 10 is lovely.
In second sample case, there are numbers 1, 2, 3, 4, 6 and 12 in the shop. 12 is divisible by 4 = 22, so 12 is not lovely, while 6 is indeed lovely.
分析:分解质因数
AC代码如下:
#include"stdio.h"int main() { _int64 n; while(scanf("%I64d",&n)!=EOF) { _int64 ans=1; for(_int64 i=2;i*i<=n;i++) { if(n%i==0) { ans*=i; while(n%i==0){n/=i; } } if(n==1) break; } if(n>1) {ans*=n;} printf("%I64d\n",ans); } return 0; }
- 分解质因数之codeforces_588B
- 蓝桥杯之分解质因数
- 数据结构之分解质因数
- C++练习之 分解质因数
- C++学习之分解质因数
- c++算法之分解质因数
- Java算法之“分解质因数”
- 分解质因数
- 分解质因数
- 质因数分解
- 分解质因数
- 质因数分解
- 分解质因数
- 分解质因数
- 质因数分解
- 分解质因数
- 分解质因数
- 分解质因数
- IntelliJ Idea 常用快捷键列表
- Java volatile
- HDU 5723 Abandoned country (最小生成树 + 期望值)
- JAVA面向对象-----main方法详解
- 制作API文档
- 分解质因数之codeforces_588B
- C++ const函数返回值必须为const引用
- hibernate集合映射inverse和cascade详解
- linux系统常用命令
- 解决关于指针的疑问
- 005-进制转换
- CodeForces 629BFar Relative’s Problem
- UVA 1149 Bin Packing
- 树莓派3b(ubuntu16.04)安装mcp2515驱动