結果

問題 No.1657 Sum is Prime (Easy Version)
ユーザー noya2noya2
提出日時 2021-08-27 21:49:47
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 32 ms / 2,000 ms
コード長 3,846 bytes
コンパイル時間 4,653 ms
コンパイル使用メモリ 276,556 KB
実行使用メモリ 19,180 KB
最終ジャッジ日時 2024-11-21 01:38:22
合計ジャッジ時間 6,200 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 28 ms
19,012 KB
testcase_01 AC 28 ms
19,016 KB
testcase_02 AC 31 ms
19,172 KB
testcase_03 AC 30 ms
19,068 KB
testcase_04 AC 30 ms
19,068 KB
testcase_05 AC 31 ms
19,148 KB
testcase_06 AC 32 ms
19,152 KB
testcase_07 AC 29 ms
19,132 KB
testcase_08 AC 28 ms
19,064 KB
testcase_09 AC 30 ms
19,072 KB
testcase_10 AC 28 ms
19,084 KB
testcase_11 AC 32 ms
19,180 KB
testcase_12 AC 31 ms
19,132 KB
testcase_13 AC 31 ms
19,180 KB
testcase_14 AC 28 ms
19,132 KB
testcase_15 AC 27 ms
19,100 KB
testcase_16 AC 27 ms
19,080 KB
testcase_17 AC 30 ms
18,956 KB
testcase_18 AC 27 ms
19,112 KB
testcase_19 AC 28 ms
19,168 KB
testcase_20 AC 28 ms
19,176 KB
testcase_21 AC 27 ms
19,144 KB
testcase_22 AC 29 ms
19,136 KB
testcase_23 AC 27 ms
18,956 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
namespace mp = boost::multiprecision;
using bint = mp::cpp_int;
*/
#include <atcoder/all>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <random>
#include <bitset>
#define rep(i,n) for (int i = 0; i < int(n); ++i)
#define repp(i,n,m) for (int i = m; i < int(n); ++i)
#define repb(i,n) for (int i = int(n)-1; i >= 0; --i)
#define fi first
#define se second
#define endl "\n"
using namespace std;
using namespace atcoder;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PL = pair<long long, long long>;
using Pxy = pair<long double, long double>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
const int INF = 1001001007;
const long long mod1 = 1000000007LL;
const long long mod2 = 998244353LL;
const ll inf = 2e18;
const ld pi = 3.14159265358979323;
const ld eps = 1e-7;
template<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}
template<class T>ostream &operator<<(ostream &os,const vector<T> &v){if(v.size()==0){os<<endl;}else{rep(i,v.size())os<<v[i]<<(i+1==v.size()?"\n":" ");}return os;}
template<class T>istream &operator>>(istream &is,vector<vector<T>> &v){for(auto &e:v)is>>e;return is;}
template<class T>ostream &operator<<(ostream &os,const vector<vector<T>> &v){if(v.size()==0){os<<endl;}else{for(auto &e:v)os<<e;}return os;}
template<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}
template<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}
template<typename T>void rev(vector<T> &v){reverse(v.begin(),v.end());}
template<typename T>void sor(vector<T> &v, int f=0){sort(v.begin(),v.end());if(f!=0) rev(v);}
template<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}
template<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<typename T>void eru(vector<T> &v){sor(v);v.erase(unique(v.begin(),v.end()),v.end());}
template<typename T>T cel(T a,T b){if(a%b==0)return a/b;return a/b +1;}
template<typename T,typename U>void out2(T a,U b){cout<<a<<" "<<b<<endl;}
template<typename T>void mout(T a){cout<<a.val()<<endl;}
void yes(){cout << "Yes" << endl;}
void no (){cout << "No" << endl;}
void yn (bool t){if(t)yes();else no();}
void dame(bool t){if(t){cout << -1 << endl;exit(0);}}
void dout(ld h=-1.23456789){cout<<setprecision(20);if(abs(h+1.23456789)>eps)cout<<h<<endl;}
void deb(ll h = INF-1) {cout << (h == INF-1 ? "!?" : to_string(h)) << endl;}
void revs(string &s) {reverse(s.begin(),s.end());}
vector<int> dx = {0,1,0,-1};
vector<int> dy = {1,0,-1,0};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string num = "0123456789";

ll gcds(ll a, ll b){
    a = abs(a); b = abs(b);
    if (b == 0) return a;
    ll c = a % b;
    while (c != 0){
        a = b;
        b = c;
        c = a % b;
    }
    return b;
}

ll tentou(vector<ll> ar){
    int n = ar.size();
    set<ll> st;
    rep(i,n) st.insert(ar[i]);
    map<ll,int> mp;
    int ind = 0;
    for (ll x : st){
        mp[x] = ind;
        ind++;
    }
    fenwick_tree<ll> fw(ind);
    ll ans = 0;
    rep(i,n){
        int a = mp[ar[i]];
        ans += i - fw.sum(0,a+1);
        fw.add(a,1);
    }
    return ans;
}

struct vs{
    vector<int> to;
};

int main(){
    int m = 2020202;
    vector<int> ar(m,0);
    repp(i,m,2){
        if (ar[i] > 0) continue;
        for (int j = i; j < m; j += i){
            ar[j] = i;
        }
    }
    vector<int> rui(m+1,0);
    rep(i,m) rui[i+1] = rui[i] + (ar[i] == i ? 1 : 0);
    int l, r; cin >> l >> r;
    cout << rui[r+1] - rui[l] + (l == r ? 0 : rui[2*r] - rui[2*l+1]) << endl;
}
0