結果

問題 No.1006 Share an Integer
ユーザー peroonperoon
提出日時 2020-03-30 12:55:49
言語 C++14
(gcc 10.1.0 + boost 1.73.0)
結果
AC  
実行時間 1,559 ms / 2,000 ms
コード長 4,783 Byte
コンパイル時間 2,082 ms
使用メモリ 67,828 KB
最終ジャッジ日時 2020-09-13 11:26:30
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 88 ms
19,096 KB
testcase_01 AC 94 ms
19,052 KB
testcase_02 AC 90 ms
19,060 KB
testcase_03 AC 92 ms
18,996 KB
testcase_04 AC 92 ms
19,032 KB
testcase_05 AC 91 ms
19,168 KB
testcase_06 AC 94 ms
19,080 KB
testcase_07 AC 92 ms
19,124 KB
testcase_08 AC 91 ms
19,060 KB
testcase_09 AC 94 ms
19,024 KB
testcase_10 AC 98 ms
19,076 KB
testcase_11 AC 894 ms
67,600 KB
testcase_12 AC 1,472 ms
67,624 KB
testcase_13 AC 1,535 ms
67,712 KB
testcase_14 AC 1,559 ms
67,772 KB
testcase_15 AC 1,353 ms
67,728 KB
testcase_16 AC 651 ms
42,992 KB
testcase_17 AC 894 ms
67,700 KB
testcase_18 AC 1,343 ms
67,776 KB
testcase_19 AC 1,316 ms
67,624 KB
testcase_20 AC 1,376 ms
67,728 KB
testcase_21 AC 1,537 ms
67,828 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
#ifdef LOCAL
    #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair
#define p_yes() p("Yes")
#define p_no() p("No")

ll SUM(VI& V){
  return accumulate(ALL(V), 0LL);
}

ll MIN(VI& V){return *min_element(ALL(V));}
ll MAX(VI& V){return *max_element(ALL(V));}

void print_vector(VI& V){
  ll n = V.size();
  rep(i, n){
    if(i) cout << ' ';
    cout << V[i];
  }
  cout << endl;
}

ll gcd(ll a,ll b){
    if(b == 0) return a;
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){
    ll g = gcd(a,b);
    return a / g * b;
}

// long double
using ld = long double;
#define EPS (1e-14)
#define equals(a,b) (fabs((a)-(b)) < EPS)

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

const int N_MAX = 2000000;
ll spf[N_MAX]; // smallest prime factors
void prepare_factorize(){
  rep(i,N_MAX) spf[i] = i;
  for(int p=2; p*p <= N_MAX; p++){
    for(int i=p; i<N_MAX; i+=p){
      if(spf[i]==i) spf[i] = p;
    }
  }
}

// 素因数分解
// その素因数が何個あるかのmapを返す
map<ll, ll> factorize_fast(ll n){
    if(spf[1]==0){
      p("please initialize");
      exit(0);
    }
    map<ll, ll> mp;
    while(n!=1){
      ll p = spf[n];
      mp[p]++;
      n/=p;
    }
    return mp;
}

// 約数の種類数
// 6 => 1, 2, 3, 6なので4
ll yaku(ll n){
  auto mp = factorize_fast(n);
  ll ret = 1;
  for(auto pa : mp){
    ret *= (pa.second+1);
  }
  return ret;
}

ll f(ll v){
  return v - yaku(v);
}

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

    // input
    ll X;cin>>X;

    prepare_factorize();

    vector<pair<ll, PII>> V;
    FOR(a, 1, X){
      ll b = X-a;
      if(b<=0) continue;
      ll v = abs(f(a)-f(b));
      V.push_back(MP(v, MP(a,b)));
    }
    sort(ALL(V));

    ll mi = V[0].first;
    for(auto triplet : V){
      if(triplet.first==mi){
        ll a = triplet.second.first;
        ll b = triplet.second.second;
        p2(a,b);
      }
    }
    
    return 0;
}
0