Language: C++

 #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <cctype>
#include <cassert>
#include <climits>
#include <string>
#include <bitset>
#include <cfloat>
#include <unordered_set>
#include <iomanip>
using namespace std;
typedef long double ld;
typedef long long int ll;
typedef unsigned long long int ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;
typedef vector<pair<int,int> > vpii;
typedef vector<vector<int> > vvi;
typedef vector<vector<char> > vvc;
typedef vector<vector<string> > vvs;
typedef vector<vector<ll> > vvll;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define irep(it, stl) for(auto it = stl.begin(); it != stl.end(); it++)
#define drep(i,n) for(int i = (n) - 1; i >= 0; --i)
#define fin(ans) cout << (ans) << endl
#define mp(p,q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define Sort(a) sort(a.begin(), a.end())
#define Rort(a) sort(a.rbegin(), a.rend())
#define MATHPI acos(-1)
int dx8[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dx4[4] = {1, 0, -1, 0};
int dy4[4] = {0, 1, 0, -1};
template <class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;} return 0;}
template <class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;} return 0;}
struct io{io(){ios::sync_with_stdio(false);cin.tie(0);}};
const int INF = INT_MAX;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;
const double EPS = 1e-9;
//ポイントは範囲クエリが来たらあらかじめ答えを計算しておくことを考えてみる、そしてその場合累積和が絡んできそう
int MAX = 1000100;
vi is_prime(MAX,1);
vi sieve (int n){
    is_prime[0] = 0,is_prime[1] = 0;
    for(i=2;i<MAX; ++i){
        //落とされた奴はcont
        if(!is_prime[i]) continue;
        //  素数の倍数をどんどん落としておく
        for(int j=i*2; j < MAX; j+=i) is_prime[j] = 0;
    }
}
int main(void) {
    //1~1000000までの範囲
    
    //まずmaxまでの素数を求める
    sieve();
    vi is2017Like(MAX,0);
    //次にその中から2017likeを抜き出して
    for(i=0,i<MAX;++i){
        if(i%2 == 0)continue;//枝狩り 
        if(is_prime[i]&& is_prime[(i+1)/2]){
            is2017Like[i] = 1;
        }
    }
    //累積和を作る
    vi S(MAX+1,0);
    S[0] = 0;
    rrep(i,MAX){
        S[i] = S[i-1] + is2017Like[i-1];
    }

    int Q;
    cin >> Q;
    rep(i,Q){
        int l,r;
        cin >> l>> r;
        //累積和ではrの一つ前までの和、例えばS[5]はa1~4までなので5の結果も欲しいならr++しなければいけない
        r++;
        fin(S[r] - S[l]);
    }

    
}

Compiler output:
a.cc: In function 'vi sieve(int)':
a.cc:63:9: error: 'i' was not declared in this scope
   63 |     for(i=2;i<MAX; ++i){
      |         ^
a.cc:69:1: warning: no return statement in function returning non-void [-Wreturn-type]
   69 | }
      | ^
a.cc: In function 'int main()':
a.cc:74:10: error: too few arguments to function 'vi sieve(int)'
   74 |     sieve();
      |     ~~~~~^~
a.cc:61:4: note: declared here
   61 | vi sieve (int n){
      |    ^~~~~
a.cc:77:9: error: 'i' was not declared in this scope; did you mean 'vi'?
   77 |     for(i=0,i<MAX;++i){
      |         ^
      |         vi
a.cc:77:22: error: expected ';' before ')' token
   77 |     for(i=0,i<MAX;++i){
      |                      ^
      |                      ;