【蓝桥杯】算法训练 素因子去重

#include <iostream>
using namespace std;
long long a[5] = {2,3,5,7};
long long b[5];

int main(){
	long long n,p = 1; 
	cin>>n;
		
		for(int i = 0; i < 4 && n > 1;){
			if(n % a[i] != 0){//除不断 
				i++;
			}else{//不是素数
				b[i] = (long long)1;
				n = n / a[i];
			}
		}
		
		for(int i = 0; i < 4; i++){
			if(b[i]){
				p = p * a[i];
			}
		}
		if(n > 1){
			p = p * n;
		}	
		cout<<p<<endl;
	
	return 0;
}