[{"sectionTitle":"题目描述","type":"Text","text":"原题来自：Waterloo local，题面详见 POJ 2689\r\n\r\n给定两个整数 $L,R$，求闭区间 $[L,R]$ 中相邻两个质数差值最小的数对与差值最大的数对。当存在多个时，输出靠前的素数对。","subType":"markdown"},{"sectionTitle":"输入格式","type":"Text","text":"多组数据。每行两个数 $L,R$。","subType":"markdown"},{"sectionTitle":"输出格式","type":"Text","text":"详见输出样例。","subType":"markdown"},{"sectionTitle":"样例","type":"Sample","text":"","subType":"markdown","payload":["2 17\n14 17","2,3 are closest, 7,11 are most distant.\nThere are no adjacent primes."]},{"sectionTitle":"数据范围与提示","type":"Text","text":"对于全部数据，$1\\le L\\lt R\\lt 2^{31},R-L\\le 10^6$。","subType":"markdown"}]