Submission #3010318
Source Code Expand
#include <iostream> #include <vector> #include <numeric> #include <algorithm> #include <queue> #include<string> #include<cstring> #include<complex> #include<cmath> using namespace std; #define rep(i, n) for(int i = 0; i < (int)(n); i++) #define rrp(i, n) for(int i = ((int)(n)); i >=0; i--) #define mpp(i,j,k) make_pair((int)(i),make_pair((int)(j),(int)(k))) typedef pair<int,pair<int,int > > ppp; typedef pair<int,int> pp; typedef vector<int> vi; typedef vector<vi> vvi; bool d[10001]; int q[10001]; bool prime(int x){ if(x==2)return true; if(x%2==0) return false; for(int i=3;i<=sqrt(x);i+=2)if(x%i==0) return false; return true; } int main(){ rep(i,10001){d[i]=prime(i);} rrp(i,10001){if(i%2==1)d[i]&=d[(i+1)/2];} rep(i,10001){q[i]=0;if(d[i])q[i]=1;if(i>0)q[i]+=q[i-1];} int Q; int l[10000],r[10000]; cin>>Q; rep(i,Q)cin>>l[i]>>r[i]; rep(i,Q)cout<<q[r[i]]-q[l[i]-1]<<endl; return 0;}
Submission Info
Submission Time | |
---|---|
Task | D - 2017-like Number |
User | tacloth |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 940 Byte |
Status | RE |
Exec Time | 103 ms |
Memory | 384 KB |
Judge Result
Set Name | Sample | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||||||
Status |
|
|
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 | RE | 103 ms | 384 KB |
02.txt | RE | 102 ms | 384 KB |
03.txt | RE | 102 ms | 384 KB |
04.txt | RE | 102 ms | 384 KB |
05.txt | RE | 101 ms | 384 KB |
06.txt | RE | 103 ms | 384 KB |
07.txt | RE | 103 ms | 384 KB |
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | WA | 1 ms | 256 KB |