20210120codeforce1474B - Different Divisors(素数筛)

Positive integer x is called divisor of positive integer y, if y is divisible by x without remainder. For example, 1 is a divisor of 7 and 3 is not divisor of 8.

We gave you an integer d and asked you to find the smallest positive integer a, such that

a has at least 4 divisors;
difference between any two divisors of a is at least d.
Input
The first line contains a single integer t (1≤t≤3000) — the number of test cases.

The first line of each test case contains a single integer d (1≤d≤10000).

Output
For each test case print one integer a — the answer for this test case.

Example
inputCopy
2
1
2
outputCopy
6
15
Note
In the first test case, integer 6 have following divisors: [1,2,3,6]. There are 4 of them and the difference between any two of them is at least 1. There is no smaller integer with at least 4 divisors.

In the second test case, integer 15 have following divisors: [1,3,5,15]. There are 4 of them and the difference between any two of them is at least 2.

The answer 12 is INVALID because divisors are [1,2,3,4,6,12]. And the difference between, for example, divisors 2 and 3 is less than d=2.

思路：找到比输入的a大的素数；然后找到比该素数大的并且之差至少为a的素数。相乘即为结果。
代码：

#include<bits/stdc++.h>
#define LL long long
using namespace std;
bool prime(int digit)
{
	if(digit==2||digit==3) return true;
	else if(digit<=1||digit%2==0) return false;
	else{
		for(int i=3;i*i<=digit;i+=2){
			if(digit%i==0) return false;
		}
		return true;
	}
}
int main()
{
	int t;
	cin>>t;
	while(t--){
		int a,ans=1,f=0;
		cin>>a;
		for(int i=a+1;;i++){
			if(prime(i)&&f==0){
				ans*=i;
				f++;
			}
			if(prime(i)&&f==1&&i-ans>=a){
				ans*=i;
				f++;
			}
			if(f==2) break;
		}
		cout<<ans<<endl;
	}
	return 0;
}

别人的用二分法写的：

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

#define maxn 1000007
ll t,d;
ll prime[maxn];
ll visit[maxn];

void Prime(){
    for (ll i = 2;i <= maxn; i++) {
        if (!visit[i]) {
            prime[++prime[0]] = i;
        }
        for (ll j = 1; j <= prime[0] && i*prime[j] <= maxn; j++) {
            visit[i*prime[j]] = 1;
            if (i % prime[j] == 0) {
                break;
            }
        }
    }
}

int main()
{
	Prime();
	//cout<<prime[78499]<<endl;
	scanf("%lld",&t);
	while(t--)
	{
		scanf("%lld",&d);
		ll tmp = 1 + d;
		int pos = lower_bound(prime + 1, prime + 1  + prime[0], tmp) - prime;
		ll tmp1 = prime[pos];
		pos = upper_bound(prime + 1, prime + 1  + prime[0], tmp1) - prime;
		while(prime[pos] - tmp1 < d) pos++;
		printf("%lld\n",prime[pos] * tmp1);
	}
	return 0;
}

总结：
主要是二分法的试水，效率高；还有就是素数判断，他这个方法效率是比较高的。
“早上起床你有两个选择 盖上被子做你没有做完的梦 掀开被子完成你没有完成的梦 ”