Submission #1927287


Source Code Expand

#include<cstdio>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#define INF 10000000;
using namespace std;

int rui[100000]={};
int sosu[100000]={};
int l[100000],r[100000];
int q;
int nummax=0;

void likegene(int);
bool sosucheck(int);

void likegene(int nummax){
	int top=nummax/2;
	for(int lp=1;lp<=nummax;lp+=2){
		if(sosucheck(lp)==true && sosucheck((lp+1)/2) ==true){
			rui[lp/2]++;
			//printf("%d is 2017lik\n",lp);
		}
		else{
			//printf("%d is not 2017like\n",lp);
		}
		
		rui[lp/2]+=rui[lp/2-1];
	}
}

bool sosucheck(int num){
	if(num==1) return false;
	if(sosu[num]==2){
		return false;
	}else if(sosu[num]==1){
		return true;
	}else{
		for(int lp=2;lp<num;lp++){
			if(num%lp==0){
				sosu[num]=2;
				return false;
			}
		}
		sosu[num]=1;
		return true;
	}
}

void ruiprint(void){
	for(int lp=0;lp<=nummax/2;lp++){
		printf("%d\n",rui[lp]);
	}
}

int main(void){
	cin >>q;
	for(int lp=0;lp<q;lp++){
		scanf("%d%d",&l[lp],&r[lp]);
		if(nummax<r[lp]){
			nummax=r[lp];
		}
	}
	
	likegene(nummax);
	//ruiprint();
	
	for(int lp=0;lp<q;lp++){
		int left=l[lp]/2;
		int right=r[lp]/2;
		//printf("%d %d\n",left,right);
		if(left==0){
			printf("%d\n",rui[right]);
		}else{
			printf("%d\n",rui[right]-rui[left-1]);
		}
	}
	
	
	
	
	
	return 0;
		
	
}

Submission Info

Submission Time
Task D - 2017-like Number
User arc
Language C++14 (GCC 5.4.1)
Score 400
Code Size 1374 Byte
Status AC
Exec Time 1356 ms
Memory 2048 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:60:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&l[lp],&r[lp]);
                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 3
AC × 10
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, sample_01.txt, sample_02.txt, sample_03.txt
Case Name Status Exec Time Memory
01.txt AC 1354 ms 1920 KB
02.txt AC 1354 ms 1920 KB
03.txt AC 1356 ms 2048 KB
04.txt AC 1354 ms 1920 KB
05.txt AC 1351 ms 2048 KB
06.txt AC 1352 ms 2048 KB
07.txt AC 1354 ms 1920 KB
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 2 ms 256 KB
sample_03.txt AC 1 ms 256 KB