結果

問題 No.371 ぼく悪いプライムじゃないよ
ユーザー heno239heno239
提出日時 2022-09-30 19:00:56
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 6,492 bytes
コンパイル時間 1,687 ms
コンパイル使用メモリ 154,664 KB
実行使用メモリ 110,960 KB
最終ジャッジ日時 2024-06-02 02:35:59
合計ジャッジ時間 16,089 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 294 ms
108,916 KB
testcase_01 AC 295 ms
109,416 KB
testcase_02 AC 312 ms
110,220 KB
testcase_03 AC 299 ms
110,148 KB
testcase_04 AC 308 ms
108,808 KB
testcase_05 AC 295 ms
108,460 KB
testcase_06 AC 304 ms
109,144 KB
testcase_07 AC 295 ms
110,960 KB
testcase_08 AC 301 ms
108,428 KB
testcase_09 AC 306 ms
110,160 KB
testcase_10 AC 294 ms
109,220 KB
testcase_11 AC 297 ms
108,064 KB
testcase_12 AC 304 ms
108,656 KB
testcase_13 AC 304 ms
108,124 KB
testcase_14 AC 297 ms
110,416 KB
testcase_15 AC 295 ms
109,680 KB
testcase_16 AC 302 ms
108,092 KB
testcase_17 AC 301 ms
109,396 KB
testcase_18 AC 296 ms
109,036 KB
testcase_19 AC 298 ms
108,432 KB
testcase_20 AC 296 ms
109,576 KB
testcase_21 AC 309 ms
109,652 KB
testcase_22 AC 272 ms
61,080 KB
testcase_23 AC 267 ms
61,084 KB
testcase_24 AC 258 ms
54,056 KB
testcase_25 AC 254 ms
53,984 KB
testcase_26 WA -
testcase_27 AC 271 ms
53,972 KB
testcase_28 AC 272 ms
54,104 KB
testcase_29 AC 259 ms
54,048 KB
testcase_30 AC 260 ms
54,160 KB
testcase_31 AC 268 ms
54,060 KB
testcase_32 AC 265 ms
54,048 KB
testcase_33 AC 270 ms
54,112 KB
testcase_34 AC 264 ms
54,160 KB
testcase_35 AC 258 ms
54,252 KB
testcase_36 AC 263 ms
55,268 KB
testcase_37 AC 261 ms
54,136 KB
testcase_38 AC 273 ms
54,240 KB
testcase_39 AC 262 ms
54,008 KB
testcase_40 AC 266 ms
54,152 KB
testcase_41 AC 270 ms
54,248 KB
testcase_42 AC 276 ms
54,388 KB
testcase_43 AC 251 ms
54,052 KB
testcase_44 AC 256 ms
54,792 KB
testcase_45 AC 295 ms
108,036 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };
//-----------------------------------------

const int mn = 100000;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}

void solve(){
	ll l, r; cin >> l >> r;
	const int sup = 10000000;
	vector<int> mip(sup,mod);
	per(i, ps.size()) {
		int p = ps[i];
		for (int j = p; j < sup; j += p) {
			mip[j] = p;
		}
	}
	vector<vector<int>> vs(mn);
	for (int i = 2; i < sup; i++) {
		int p = mip[i];
		if (r / p < 10000000&&p<mod) {
			vs[p].push_back(i);
		}
	}
	int loc = 2;
	int ma = 1;
	per(i, ps.size()) {
		int p = ps[i];
		if (p > r)continue;
		if (r / p < 10000000) {
			for (int val : vs[p]) {
				if (val <= loc) {
					chmax(ma, val);
				}
			}
			//cout << p << " " << ma << "\n";
			while (loc < sup && (ll)p * loc <= r) {
				if (mip[loc] >= p) {
					chmax(ma, loc);
				}
				loc++;
			}
			//cout << p << " " << ma << "\n";
			ll z = (ll)p * ma;
			if (z >= l&&ma>1) {
				cout << z << "\n"; return;
			}
		}
		else {
			ll v = r / p;
			for (ll i = v; i*p>=l&&i>1; i--) {
				ll z = i * p;
				bool valid = true;
				for (int j = 0;; j++) {
					if (ps[j] == p)break;
					if (z % ps[j]) {
						valid = false; break;
					}
				}
				if (valid) {
					cout << z << "\n"; return;
				}
			}
		}
	}
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f();
	init();
	//expr();
	//while(true)
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0