CF 588B Duff in Love

最新推荐文章于 2022-08-03 14:55:17 发布

风动护花

最新推荐文章于 2022-08-03 14:55:17 发布

阅读量802

点赞数

CC 4.0 BY-SA版权

分类专栏： (●´ω｀●)φ 模拟技巧题 ACM水题训练

本文链接：https://blog.youkuaiyun.com/u011151784/article/details/49516097

ACM水题训练同时被 3 个专栏收录

40 篇文章

订阅专栏

模拟

29 篇文章

订阅专栏

技巧题

28 篇文章

订阅专栏

本文介绍了一个算法问题，即从给定正整数n的所有正除数中找出最大的可爱数。可爱数是指不能被任何大于1的整数的平方整除的数。通过去除n中所有可能的平方因子来实现这一目标。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

$\text{[math]}$

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 test(s)

input
10

output
10

input
12

output
6

Note

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 indeedlovely.

对代码解释一下：如果一个数能被i的平方整除，那么就把这个数除I,

#include<iostream>
#include<stdio.h>
using namespace std;
int main()
{
	long long n;
	scanf("%I64d",&n);
	//cin >> n;
	for(long long i=2;i*i<=n;i++)
	{
		while(n%(i*i)==0)n/=i;
	}
	printf("%I64d\n",n);
	//cout<<n<<endl;
	return 0;
}