反素數
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4327 Accepted Submission(s): 2511
輸入包括a,b, 1<=a<=b<=5000,表示閉區間[a,b].
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x3f3f3f3f
#define inf -0x3f3f3f3f
#define mem0(a) memset(a,0,sizeof(a))
int num[5000+10];
void biao(){
mem0(num);
for(int i = 1 ; i <= 5000 ; i++){
for(int j = 1 ; j <= i ; j++)
if(i%j==0)
num[i]++;
}
}
int main()
{
int n;
biao();
while(scanf("%d",&n)!=EOF){
while(n--){
int a,b;
scanf("%d%d",&a,&b);
int _min = num[a],k=a;
for(int i= a+1 ; i <= b ; i++){
if(num[i]>_min){
_min=num[i];
k=i;
}
}
printf("%d\n",k);
}
}
return 0;
}