LOJ #6221. 幂数！

题意

求<=n的正整数中，符合 所有的质因数的平方也是该数的约数 的数的个数 and 和

题解

题意有链接，点进去一看，知道这类数一定是 \(a^2*b3\)

然后就好做了，枚举\(a^2\), \(b^3\)，即可

调试记录

vector下标从0开始

当 \(a^2*b3 > n\) 时break，不然会T

#include <cstdio>
#include <set>
#include <vector>
#define int long long

using namespace std;

int n, sum = 0;
int cnt_2, cnt_3;

vector <int> two, three;
set <int> ans;

signed main(){
	scanf("%lld", &n);
	
	int i = 1;
	while (i * i <= n){
		two.push_back(i * i);
		i++;
	} cnt_2 = i - 1;
	
	i = 1;
	while (i * i * i <= n){
		three.push_back(i * i * i);
		i++;
	} cnt_3 = i - 1;
	
	for (int i = 0; i < cnt_2; i++){
		for (int j = 0; j < cnt_3; j++){
			if (two[i] * three[j] <= n && ans.count(two[i] * three[j]) == 0) ans.insert(two[i] * three[j]), sum += two[i] * three[j];
			else break;
		}
	}
	
	printf("%lld\n%lld\n", (long long)ans.size(), (long long)sum);
	return 0;
}