#1194734 (C++23) No.3776 Magic Square of Product

• 問題: No.3776 Magic Square of Product
• ユーザー: igeee
• 提出日時: 2026-10-23 23:09:11
• 言語: C++23 (gcc 15.3.0 + boost 1.92.0 + ACL)
• 結果: WA
• 実行時間: -
• コード長: 8,986 bytes
• コンパイル時間: 8,485 ms
• コンパイル使用メモリ: 428,284 KB
• 実行使用メモリ: 19,348 KB
• 最終ジャッジ日時: 2026-10-23 23:09:30
• 合計ジャッジ時間: 14,094 ms
• ジャッジサーバーID （参考情報）: judge1_0 / judge3_0

ファイルパターン	結果
sample	WA * 1
other	WA * 25

ソースコード

// Templates and Snippets -> https://github.com/igeeeeee/template
#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using i128 = __int128_t;
using u128 = __uint128_t;
ostream& operator<<(ostream& os, u128 x) {if (x >= 10) os << x / 10;return os << char('0' + x % 10);}
ostream& operator<<(ostream& os, i128 x){if (x < 0){os << '-';return os << (-(u128)x);}return os << (u128)x;}
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<pair<ll ,ll>>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef pair<ll ,ll> pll;
typedef pair<ull,ull> pull;
typedef tuple<ll , ll , ll> tpl3;
typedef tuple<ll , ll , ll , ll> tpl4;
typedef tuple<ll , ll , ll , ll , ll> tpl5;
typedef tuple<ll , ll , ll , ll , ll , ll> tpl6;
#define FI first
#define SE second
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a)  (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
 
ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}
ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
  
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} 
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;

void solve();
#ifdef DEBUG
void naive();
string run(void (*f)(), const string& input) {istringstream iss(input);ostringstream oss;auto* cinbuf = cin.rdbuf(iss.rdbuf());auto* coutbuf = cout.rdbuf(oss.rdbuf());cin.clear();f();cout.flush();cin.rdbuf(cinbuf);cout.rdbuf(coutbuf);cin.clear();return oss.str();}

bool check(const string& input) {
  string ans = run(solve, input);istringstream acin(ans);
  string correct = run(naive, input);istringstream ccin(correct);
  // ll x;acin >> x;とかで使える(構築とかの確認用)

  if (ans == correct) return true;//末尾の空白まで完全一致

  cerr << "========== INPUT ==========\n";
  cerr << input;
  cerr << "========== EXPECTED =======\n";
  cerr << correct;
  cerr << "========== ACTUAL =========\n";
  cerr << ans;
  cerr << "===========================\n";
  return false;
}

uint64_t seed = chrono::steady_clock::now().time_since_epoch().count();
mt19937_64 rng(seed);
ll rnd(ll l, ll r){// l 以上 r 以下
  return uniform_int_distribution<ll>(l, r)(rng);
}

void test(){
  rep(tc,100000){
    // ----- テストケース生成(文字列で!!) -----
    string input;
    ll n = rnd(1,10);
    input += to_string(n);
    input += '\n';

    // ----- 比較 -----
    check(input);

    if ((tc+1) % 1000 == 0) {
      cerr << tc+1 << " cases passed\n";
    }
  }
}

void naive(){//cinで受け取りcoutで出力でよい

}
#endif

//ref https://qiita.com/drken/items/3beb679e54266f20ab63#5-%E6%B4%BB%E7%94%A8%E4%BE%8B-2-%E3%83%A1%E3%83%93%E3%82%A6%E3%82%B9%E9%96%A2%E6%95%B0%E5%80%A4%E3%81%AE%E5%88%97%E6%8C%99
struct Eratosthenes{
  ll n;
  vector<bool> isprime;//素数ならtrue
  vector<ll> minfact;//xを割り切る一番小さい数
  vector<ll> mobius;// メビウス関数値
  /*
  メビウス関数u(x)とは
  u(1) = 1;
  xがある素数pで2回以上割り切れるとき、u(x) = 0;
  x = p1 * p2 * p3 * p4...pKと素因数分解できるときu(x) = (-1)^k 
  u(1)=1,u(2)=-1,u(3)=-1,u(4)=0,u(5)=-1,u(6)=1,u(7)=-1,u(8)=0,u(9)=0,u(10)=1
  */
  Eratosthenes(ll N){//O(NloglogN)
    n = N;
    isprime.resize(n+1,true);
    minfact.resize(n+1,-1);
    mobius.resize(n+1,1);
    isprime[0] = false;
    isprime[1] = false;
    minfact[1] = 1;
    for(ll p = 2;p <= n;p++){
      if(!isprime[p])continue;
      //pの情報を更新
      minfact[p] = p;
      mobius[p] = -1;
      for(ll q = p*2;q <= n;q+=p){
        isprime[q] = false;
        if(minfact[q] == -1)minfact[q] = p;
        if((q/p)%p==0)mobius[q]=0;//qはpで2回以上割れる
        else mobius[q] = -mobius[q];//反転
      }
    }
  }

  bool is_prime(ll x){
    assert(x <= n);
    return isprime[x];
  }

  //素因数分解(log(x))
  vector<pair<ll,ll>> soinsu_bunkai(ll x){
    vector<pair<ll,ll>> ret;
    while(x > 1){
      ll p = minfact[x];
      ll times = 0;//割り切れる回数
      while(minfact[x] == p){
        x/= p;
        times++;
      }
      ret.push_back({p,times});
    }
    return ret;
  }

  //約数列挙 O(約数の個数)　n <= 10^9 のとき 高々1344
  vector<ll> yakusu_rekkyo(ll x){
    vector<ll> ret;
    ret.push_back(1);
    vector<pair<ll,ll>> pf = soinsu_bunkai(x);
    for(auto &p:pf){
      ll siz = ret.size();
      for(ll i = 0;i < siz;i++){
        ll v = 1;
        for(ll j = 0;j < p.second;j++){
          v *= p.first;
          ret.push_back(ret[i]*v);
        }
      }
    }
    return ret;
  }
};

// 高速ゼータ変換
// 入力 f が in-place に更新されて、F になる
template<class T> void fast_zeta(vector<T> &f){
  ll n = f.size();
  Eratosthenes era(n);
  vector<bool> isprime = era.isprime;
  // 各素数 p 軸に対して
  // 大きい座標 (k * p) から小さい座標 (k) へと足し込む
  for(ll p = 2;p < n;p++){
    if(!isprime[p])continue;
    for(ll k = (n-1)/p;k >= 1;k--){
      f[k] += f[k * p];
    }
  }
} 
// 高速メビウス変換
// 入力 F が in-place に更新されて、f になる
template<class T> void fast_mobius(vector<T> &F){
  ll n = F.size();
  Eratosthenes era(n);
  vector<bool> isprime = era.isprime;
  // 各素数 p 軸に対して
  // 小さい座標 (k) から大きい座標 (k * p) を引いていく
  for(ll p = 2;p < n;p++){
    if(!isprime[p])continue;
    for(ll k = 1;k * p < n;k++){
      F[k] -= F[k * p];
    }
  }
}
void solve(){
  Eratosthenes et(lpow(10,6)+1);
  map<vll,ll>mp;
  repsn(i,1,lpow(10,6)){
    vpll tmp = et.soinsu_bunkai(i);
    vll z;
    each(p,tmp)z.push_back(p.second);
    sort(all(z));
    mp[z]++;
  } 
  cout << sz(mp) << endl;
}
 
int main(){
  ios::sync_with_stdio(false);cin.tie(nullptr);
  #ifdef DEBUG
    test();
  #else
    solve();
  #endif
}