結果

問題 No.2751 429-like Number
ユーザー NAMIDAIRONAMIDAIRO
提出日時 2024-05-11 00:30:19
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,058 ms / 4,000 ms
コード長 5,981 bytes
コンパイル時間 1,511 ms
コンパイル使用メモリ 123,096 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-20 08:10:43
合計ジャッジ時間 18,156 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
6,820 KB
testcase_01 AC 3 ms
6,816 KB
testcase_02 AC 4 ms
6,816 KB
testcase_03 AC 4 ms
6,816 KB
testcase_04 AC 4 ms
6,816 KB
testcase_05 AC 3 ms
6,816 KB
testcase_06 AC 5 ms
6,816 KB
testcase_07 AC 691 ms
6,816 KB
testcase_08 AC 1,057 ms
6,816 KB
testcase_09 AC 1,055 ms
6,820 KB
testcase_10 AC 1,058 ms
6,816 KB
testcase_11 AC 1,054 ms
6,816 KB
testcase_12 AC 633 ms
6,820 KB
testcase_13 AC 1,051 ms
6,820 KB
testcase_14 AC 1,025 ms
6,820 KB
testcase_15 AC 28 ms
6,820 KB
testcase_16 AC 890 ms
6,816 KB
testcase_17 AC 887 ms
6,816 KB
testcase_18 AC 636 ms
6,820 KB
testcase_19 AC 630 ms
6,816 KB
testcase_20 AC 696 ms
6,816 KB
testcase_21 AC 630 ms
6,816 KB
testcase_22 AC 635 ms
6,820 KB
testcase_23 AC 643 ms
6,816 KB
testcase_24 AC 634 ms
6,816 KB
testcase_25 AC 632 ms
6,820 KB
testcase_26 AC 620 ms
6,816 KB
testcase_27 AC 626 ms
6,816 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <random>
#include <iomanip>
#include <string>
#include <cmath>
#include <complex>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
template<class T>
using vi = vector<T>;
template<class T>
using vii = vector<vi<T>>;
template<class T>
using viii = vector<vii<T>>;
template<class T>
using viiii = vector<viii<T>>;
using P = pair<ll, int>;
void chmin(ll & x, ll y) { x = min(x, y); }
void chmax(ll& x, ll y) { x = max(x, y); }
struct mint {
const long long mod = 998244353;
long long x;
mint(long long x_ = 0) : x((x_% mod + mod) % mod) {}
mint& operator+=(const mint& other) {
x += other.x;
if (x >= mod) x -= mod;
return *this;
}
mint& operator-=(const mint& other) {
x -= other.x;
if (x < 0) x += mod;
return *this;
}
mint& operator*=(const mint& other) {
x *= other.x;
x %= mod;
return *this;
}
mint& operator+=(const long long n) {
return *this += mint(n);
}
mint& operator-=(const long long n) {
return *this -= mint(n);
}
mint& operator*=(const long long n) {
return *this *= mint(n);
}
mint& operator=(const mint& other) {
x = other.x;
return *this;
}
mint& operator=(const long long n) {
x = n % mod;
return *this;
}
bool operator==(const mint& other) const {
return x == other.x;
}
bool operator!=(const mint& other) const {
return x != other.x;
}
mint operator-() const {
mint res(mod - x);
return res;
}
mint operator+(const mint& other) const {
mint res(x);
return res += other;
}
mint operator-(const mint& other) const {
mint res(x);
return res -= other;
}
mint operator*(const mint& other) const {
mint res(x);
return res *= other;
}
mint operator+(const long long n) const {
mint res(x);
mint other(n);
return res += other;
}
mint operator-(const long long n) const {
mint res(x);
mint other(n);
return res -= other;
}
mint operator*(const long long n) const {
mint res(x);
mint other(n);
return res *= other;
}
mint pow(long long n) const {
if (n == 0) return mint(1);
mint res = pow(n / 2);
res *= res;
if (n % 2) res *= *this;
return res;
}
mint inv() const {
return pow(mod - 2);
}
mint& operator/=(const mint& other) {
*this *= other.inv();
return *this;
}
mint operator/(const mint& other) const {
mint res(x);
return res /= other;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int m) :fact(m + 1), ifact(m + 1) {
fact[0] = 1;
for (int i = 1; i <= m; i++) fact[i] = fact[i - 1] * mint(i);
ifact[m] = fact[m].inv();
for (int i = m; i >= 1; i--) ifact[i - 1] = ifact[i] * mint(i);
}
mint operator()(int n, int k) {//for n<=m, calc nck
if (k < 0 || k > n) return mint(0);
return fact[n] * ifact[k] * ifact[n - k];
}
};
template<class T>
struct NTT {
const int divlim = 23; //when mod is 998244353
vector<mint> root, invroot;
const mint primitive = 3;
NTT() : root(divlim + 1), invroot(divlim + 1) {
root[divlim] = primitive.pow((primitive.mod - 1) >> divlim);
invroot[divlim] = root[divlim].inv();
for (int i = divlim - 1; i >= 0; i--) {
root[i] = root[i + 1] * root[i + 1];
invroot[i] = invroot[i + 1] * invroot[i + 1];
}
}
void dft(vector<mint>& d, const int log, const bool inv = false) {
int n = (int)d.size();
if (n == 1 || log == 0) return;
vector<mint> d0, d1;
for (int i = 0; i < n / 2; i++) {
d0.push_back(d[2 * i]);
d1.push_back(d[2 * i + 1]);
}
dft(d0, log - 1, inv);
dft(d1, log - 1, inv);
mint pow = 1, z = (inv ? invroot[log] : root[log]);
for (int i = 0; i < n / 2; i++) {
d[i] = d0[i] + d1[i] * pow;
pow *= z;
}
for (int i = n / 2; i < n; i++) {
d[i] = d0[i - n / 2] + d1[i - n / 2] * pow;
pow *= z;
}
return;
}
void idft(vector<mint>& d, const int log) {
dft(d, log, true);
return;
}
vector<mint> convolution(vector<T>& f, vector<T>& g) {
int n = 1, log = 0, lenf = (int)f.size(), leng = (int)g.size();
while (n < lenf + leng) {
n <<= 1;
log++;
}
vector<mint> df(n), dg(n);
for (int i = 0; i < lenf; i++) df[i] = f[i];
for (int i = 0; i < leng; i++) dg[i] = g[i];
dft(df, log);
dft(dg, log);
for (int i = 0; i < n; i++) df[i] *= dg[i];
idft(df, log);
mint ninv = mint(n).inv();
for (int i = 0; i < n; i++) df[i] *= ninv;
return df;
}
};
int main()
{
int q;
cin >> q;
vi<ll> a(q);
rep(i, q) cin >> a[i];
vi<ll> prime;
int n = 100010;
vi<bool> check(n);
for (ll i = 2; i < n; i++) {
if (check[i]) continue;
prime.push_back(i);
for (ll j = i + i; j < n; j += i) check[j] = true;
}
int sz = (int)prime.size();
rep(i, q) {
int cnt = 0;
rep(j, sz) {
while (a[i] % prime[j] == 0) {
a[i] /= prime[j];
cnt++;
}
if (cnt > 3) break;
}
if (cnt > 3) cout << "No" << endl;
else if (cnt == 3 && a[i] == 1) cout << "Yes" << endl;
else if (cnt == 2 && a[i] > 1) cout << "Yes" << endl;
else cout << "No" << endl;
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0