UVA 10140

10140 - Prime Distance

题目链接

题意：求[l,r]区间内近期和最远的素数对。

思路：素数打表，打到sqrt(Max)就可以，然后利用大的表去筛素数，因为[l, r]最多100W，所以能够去遍历一遍，找出答案。注意1的情况，一開始没推断1，结果WA了

代码：

#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;

#define INF 0x3f3f3f3f3f
const int N = 100005;
long long l, r, vis[N * 10], prime[N], pn = 0;

int main() {
	for (long long i = 2; i < N; i++) {
		if (vis[i]) continue;
		prime[pn++] = i;
		for (long long j = i; j < N; j += i)
			vis[j] = 1;
 	}
 	while (~scanf("%lld%lld", &l, &r)) {
 		memset(vis, 0, sizeof(vis));
 		for (long long i = 0; i < pn; i++) {
  			for (long long j = (l / prime[i] + (l % prime[i] != 0)) * prime[i]; j <= r; j += prime[i]) {
  				if (j / prime[i] != 1)
  					vis[j - l] = 1;
     		}
		}
		long long pre = -1;
		long long Max = 0, Min = INF;
		long long maxl, maxr, minl, minr, flag = 1;
		for (long long i = l; i <= r; i++) {
			if (vis[i - l] || i == 1) continue;
			if (pre != -1) {
				if (i - pre > Max) {
			 		Max = i - pre;
			 		maxl = pre; maxr = i;
    			}
    			if (i - pre < Min) {
    				Min = i - pre;
    				minl = pre; minr = i;
       			}
				flag = 0;
   			}
   			pre = i;
  		}
  		if (flag) printf("There are no adjacent primes.
");
  		else printf("%lld,%lld are closest, %lld,%lld are most distant.
", minl, minr, maxl, maxr);
  	}
	return 0;
}