hdu5778 abs 素数筛法 暴力枚举

abs

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1236    Accepted Submission(s): 429

Problem Description

Given a number x, ask positive integer  y≥2 , that satisfy the following conditions:
1. The absolute value of y - x is minimal
2. To prime factors decomposition of Y, every element factor appears two times exactly.

 

Input

The first line of input is an integer T (  1≤T≤50 )
For each test case，the single line contains, an integer x (  1≤x≤1018 )

 

Output

For each testcase print the absolute value of y - x

 

Sample Input

  
  

   
   5
1112
4290
8716
9957
9095
  
  

 

Sample Output

  
  

   
   23
65
67
244
70
  
  

 

因为y中质因分解式中质因数的个数为偶数，所以y开方后，根号下y的质因分解式中一定是不同的质数组成的

可以对x开方，根号下x的数据范围降到了10^9，因为(10^5)^2 = 10 ^ 10 > 10 ^ 9，所以可以打一张10 ^ 5范围内的质数表

对于根号下x进行左右偏移，对每次偏移判断是否存在两个或两个以上的质因子，有的话说明这个数字不行，因为要保证平方后的数每个质因子个数为2

#include <cstdio>
#include <cstring>
#include <iostream>
#include <cmath>
#include <algorithm>

using namespace std;
typedef long long ll;

int T;
ll n, m, mb, mm, primer[100005], num[100005], len;
bool flag;

int main()
{
	memset(primer, 0, sizeof(primer));
	primer[0] = primer[1] = 1; len = 0;
	for (ll i = 2; i <= 100003; i++) {
		if (!primer[i]) num[len++] = i;
		if (!primer[i]) {
			for (ll j = 2; i * j <= 100003; j++) {
				primer[i * j] = 1;
			}
		}
	}
	cin >> T;
	while (T--) {
		scanf("%I64d", &n);
		if (n <= 4) {
			switch (n) {
				case 1: puts("3"); break;
				case 2: puts("2"); break;
				case 3: puts("1"); break;
				case 4: puts("0"); break;
			}
			continue;
		}
		m = (ll)sqrt(n);
		mb = m + 1;
		while (true) {
			flag = (n - m * m) < (mb * mb - n) ? true : false; //debug
			ll tm = flag ? m : mb;
			bool f = true;
			for (int i = 0; i < len && num[i] * num[i] <= tm; i++) {
				if (tm % num[i] == 0) {
					tm /= num[i]; //debug
					if (tm % num[i] == 0) {
						f = false;
						break;
					}
				}
			}
			if (f) {
				printf("%I64d\n", flag ? n - m * m : mb * mb - n);
				break;
			}
			flag ? (m -= 1) : (mb += 1);
		}
	}
	return 0;
}