第十四届蓝桥杯集训——练习解题阶段(无序阶段)-ALGO-190 素因子去重

#include<stdio.h>
#include<math.h>
int main(){
	long long n,p=1;
	int i,j=0,t=1;
	scanf("%I64d",&n);
	if(n%2==0)p=2;
	while(n%2==0){
		n=n/2;
	} 
	for(i=3;i<=sqrt(n);i=i+2){
		while(n%i==0){
		n=n/i;	
		t=0;
	}
	if(t==0){
	p=p*i;
	t=1;
}
}
if(n>2)p=p*n;
	printf("%I64d",p);
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long

template<class T>
void read(T& ret)
{
    ret = 0;
    char c;
    while ((c = getchar()) > '9' || c < '0');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + c - '0';
        c = getchar();
    }
}

int main()
{
    ll n;
    read(n);
    ll tmp = 1;
    for (int i = 2; i * i <= n; i++)
    {
        if (n % i == 0)
        {
            tmp *= i;
            while (n % i == 0)
            {
                n /= i;
            }
        }
    }
    if (n > 1)
        tmp *= n;
    printf("%lld\n", tmp);
    return 0;
}

import java.util.HashSet;
import java.util.Scanner;

//素因子去重
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		HashSet<Long> hs=new HashSet<Long>();
		long n=sc.nextLong();
		long i=2;
		while(i<=n) {
			if(n%i==0) {
				if(method(i)) {
					hs.add(i);
				}
				n=n/i;
			}else
				i++;
		}
		long p=1;
		for (Long long1 : hs) {
			p*=long1;
		}
		 System.out.println(p);
	}
	//判断素数
	public static boolean method(long n) {
		for(long i=2;i<=Math.sqrt((double)n);i++){
			if(n%i==0) 
			return false;
		}
		return true;
	}
}

n = int(input())
prime_set = set()
while n % 2 == 0:
    prime_set.add(2)
    n //= 2
N = int(pow(n, 0.5))
for A in range(3, N, 2):
    while n % A == 0:
        prime_set.add(A)
        n //= A
if n > 2:
    prime_set.add(n)
result_num = 1
for B in prime_set:
    result_num *= B
print(result_num)