提出 #41162530

---

ソースコード 拡げる

#include <atcoder/all>
using namespace atcoder;
#include <bits/stdc++.h>
#include <cassert>
using namespace std;
using ll = long long;
const double pi = 3.14159265359;
const ll INF = 1LL << 60;

template<class T> inline bool chmin(T& a, T b){ if (a > b){a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b){ if (a < b){a = b; return true;} return false;}

//using mint = modint998244353;
//using mint = modint1000000007;
//using mint = modint;  // mint::set_mod(p); later
//using mint = static_modint<1000000009>;

void solve()
{
  ll N;
  cin >> N;

  // b^d <= を満たす最大の b
  set<ll> ds;
  ds.insert(2);
  ds.insert(N);
  if (N >= 3) ds.insert(N - 1);

  int len = 1;
  while ((1LL << len) <= N){ len++; }
  
  for (int d = 3; d <= len ; d++){
    ll ok = 1;
    ll ng = (ll) 2e9;
    while (abs(ok - ng) > 1){
      ll mid = (ok + ng) / 2;
      __uint128_t x = 1;
      for (int i = 0; i < d - 1; i++){
	x *= mid;
	if (x > N) break;
      }
      if (x <= N) ok = mid;
      else ng = mid;
    }
    
    if (ok > 2) ds.insert(ok);
  }

  ll ans = 0;
  for (ll d : ds){
    if (d == 2 || d == N || d == N - 1){
      ans++;
      continue;
    }
    
    bool ok = true;
    ll x = N;
    while (x > 0){
      if (x % d > 1){
	ok = false;
	break;
      }
      x /= d;
    }
    if (ok) ans++;
  }
  
  cout << ans << "\n";
}

int main()
{
  cin.tie(0); cout.tie(0); ios::sync_with_stdio(false);

  int T;
  cin >> T;
  for (int i = 0; i < T; i++){
    solve();
  }
  return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In function ‘void solve()’:
./Main.cpp:40:8: warning: comparison of integer expressions of different signedness: ‘__int128 unsigned’ and ‘ll’ {aka ‘long long int’} [-Wsign-compare]
   40 |  if (x > N) break;
      |      ~~^~~
./Main.cpp:42:13: warning: comparison of integer expressions of different signedness: ‘__int128 unsigned’ and ‘ll’ {aka ‘long long int’} [-Wsign-compare]
   42 |       if (x <= N) ok = mid;
      |           ~~^~~~

ジャッジ結果