QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#843274#9962. Diminishing Fractionsucup-team112#WA 1ms4548kbC++2014.7kb2025-01-04 17:44:462025-01-04 17:44:46

Judging History

你现在查看的是最新测评结果

  • [2025-01-04 17:44:46]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:4548kb
  • [2025-01-04 17:44:46]
  • 提交

answer

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// #define INTERACTIVE

#include <bits/stdc++.h>
using namespace std;

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#if !defined(RIN__LOCAL) && !defined(INTERACTIVE)
#define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {
// __int128_t
std::istream &operator>>(std::istream &is, __int128_t &value) {
    std::string str;
    is >> str;
    value    = 0;
    int sign = 1;
    for (size_t i = 0; i < str.size(); i++) {
        if (i == 0 && str[i] == '-') {
            sign = -1;
            continue;
        }
        value = value * 10 + str[i] - '0';
    }
    value *= sign;
    return is;
}

std::ostream &operator<<(std::ostream &dest, __int128_t value) {
    std::ostream::sentry s(dest);
    if (s) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[128];
        char *d = std::end(buffer);
        do {
            --d;
            *d = "0123456789"[tmp % 10];
            tmp /= 10;
        } while (tmp != 0);
        if (value < 0) {
            --d;
            *d = '-';
        }
        int len = std::end(buffer) - d;
        if (dest.rdbuf()->sputn(d, len) != len) {
            dest.setstate(std::ios_base::badbit);
        }
    }
    return dest;
}

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

const int N = 50050;
vector<bool> is_prime(N);
vector<string> memo(N);

void init() {
    memo.assign(N, "");
    is_prime.assign(N, true);
    is_prime[0] = is_prime[1] = false;
    for (int i = 2; i * i < N; i++) {
        if (is_prime[i]) {
            for (int j = i * 2; j < N; j += i) {
                is_prime[j] = false;
            }
        }
    }
}

template <typename T>
T modinv(T a, T MOD) {
    T b = MOD;
    T u = 1;
    T v = 0;
    while (b > 0) {
        T t = a / b;
        a -= t * b;
        u -= t * v;
        std::swap(a, b);
        std::swap(u, v);
    }
    if (a != 1) return -1;
    if (u < 0) u += MOD;
    return u;
}

template <typename T, typename S>
T modpow(T a, S b, T MOD) {
    T ret = 1;
    while (b > 0) {
        if (b & 1) {
            ret *= a;
            ret %= MOD;
        }
        a *= a;
        a %= MOD;
        b >>= 1;
    }
    return ret;
}

void solve() {
    INT(n);
    if (n == 1) {
        print("1/1");
        return;
    }
    vec(ll, X, 0);
    int ma = 0;
    fori(i, 1, n + 1) {
        if (!is_prime[i]) continue;
        ll x = i;
        while (x * i <= n) {
            x *= i;
        }
        if (x != i) ma = max<int>(ma, x);
        X.push_back(x);
    }

    sort(all(X));
    if (X.back() >= 12 and memo[X.back()] != "") {
        print(memo[X.back()]);
        return;
    }

    int lx = X.size();
    vec(int, Y, lx);
    double tot = 0.0;
    fori(i, lx) {
        tot += double(Y[i]) / double(X[i]);
    }

    string ans = "";

    fori(i, lx) {
        ll x = X[i];
        ll p = 1;
        fori(j, lx) {
            if (i == j) continue;
            p = p * X[j] % x;
        }

        auto y = modinv(p, x);
        Y[i]   = x - y;

        ans += "-" + to_string(Y[i]) + "/" + to_string(X[i]);
        tot += double(Y[i]) / double(X[i]);
        if (X[i] >= ma) {
            memo[X[i]] = ans + "+" + to_string(int(round(tot))) + "/" + "1";
        }
    }

    if (n <= 10) {
        double x = 1.0;
        for (int i = 1; i <= n; i++) {
            x /= i;
        }
        tot += x;
    }
    ans += "+" + to_string(int(round(tot))) + "/" + "1";
    print(ans);
}

int main() {
    init();
#ifndef INTERACTIVE
    std::cin.tie(0)->sync_with_stdio(0);
#endif
    // std::cout << std::fixed << std::setprecision(12);
    int t;
    t = 1;
    std::cin >> t;
    while (t--) solve();
    return 0;
}

// // #pragma GCC target("avx2")
// // #pragma GCC optimize("O3")
// // #pragma GCC optimize("unroll-loops")
// // #define INTERACTIVE
//
// #include "kyopro-cpp/template.hpp"
//
// const int N = 50050;
// vector<bool> is_prime(N);
// vector<string> memo(N);
//
// void init() {
//     memo.assign(N, "");
//     is_prime.assign(N, true);
//     is_prime[0] = is_prime[1] = false;
//     for (int i = 2; i * i < N; i++) {
//         if (is_prime[i]) {
//             for (int j = i * 2; j < N; j += i) {
//                 is_prime[j] = false;
//             }
//         }
//     }
// }
//
// #include "math/modinv.hpp"
// #include "math/modpow.hpp"
//
// void solve() {
//     INT(n);
//     if (n == 1) {
//         print("1/1");
//         return;
//     }
//     vec(ll, X, 0);
//     int ma = 0;
//     fori(i, 1, n + 1) {
//         if (!is_prime[i]) continue;
//         ll x = i;
//         while (x * i <= n) {
//             x *= i;
//         }
//         if (x != i) ma = max<int>(ma, x);
//         X.push_back(x);
//     }
//
//     sort(all(X));
//     if (X.back() >= 12 and memo[X.back()] != "") {
//         print(memo[X.back()]);
//         return;
//     }
//
//     int lx = X.size();
//     vec(int, Y, lx);
//     double tot = 0.0;
//     fori(i, lx) {
//         tot += double(Y[i]) / double(X[i]);
//     }
//
//     string ans = "";
//
//     fori(i, lx) {
//         ll x = X[i];
//         ll p = 1;
//         fori(j, lx) {
//             if (i == j) continue;
//             p = p * X[j] % x;
//         }
//
//         auto y = modinv(p, x);
//         Y[i]   = x - y;
//
//         ans += "-" + to_string(Y[i]) + "/" + to_string(X[i]);
//         tot += double(Y[i]) / double(X[i]);
//         if (X[i] >= ma) {
//             memo[X[i]] = ans + "+" + to_string(int(round(tot))) + "/" + "1";
//         }
//     }
//
//     if (n <= 10) {
//         double x = 1.0;
//         for (int i = 1; i <= n; i++) {
//             x /= i;
//         }
//         tot += x;
//     }
//     ans += "+" + to_string(int(round(tot))) + "/" + "1";
//     print(ans);
// }
//
// int main() {
//     init();
// #ifndef INTERACTIVE
//     std::cin.tie(0)->sync_with_stdio(0);
// #endif
//     // std::cout << std::fixed << std::setprecision(12);
//     int t;
//     t = 1;
//     std::cin >> t;
//     while (t--) solve();
//     return 0;
// }

詳細信息

Test #1:

score: 100
Accepted
time: 1ms
memory: 4396kb

input:

2
3
6

output:

-1/2-1/3+1/1
-1/3-1/4-2/5+1/1

result:

ok OK, t = 2

Test #2:

score: 0
Accepted
time: 1ms
memory: 4464kb

input:

1
1

output:

1/1

result:

ok OK, t = 1

Test #3:

score: 0
Accepted
time: 0ms
memory: 4444kb

input:

10
1
2
3
4
5
6
7
8
9
10

output:

1/1
-1/2+1/1
-1/2-1/3+1/1
-2/3-1/4+1/1
-1/3-1/4-2/5+1/1
-1/3-1/4-2/5+1/1
-1/3-3/4-1/5-5/7+2/1
-2/3-3/5-6/7-7/8+3/1
-1/5-2/7-5/8-8/9+2/1
-1/5-2/7-5/8-8/9+2/1

result:

ok OK, t = 10

Test #4:

score: -100
Wrong Answer
time: 0ms
memory: 4548kb

input:

54
7
20
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
3
47
81

output:

-1/3-3/4-1/5-5/7+2/1
-2/5-5/7-4/9-2/11-9/13-1/16-5/17-4/19+3/1
-1/2+1/1
-1/2-1/3+1/1
-2/3-1/4+1/1
-1/3-1/4-2/5+1/1
-1/3-1/4-2/5+1/1
-1/3-3/4-1/5-5/7+2/1
-2/3-3/5-6/7-7/8+3/1
-1/5-2/7-5/8-8/9+2/1
-1/5-2/7-5/8-8/9+2/1
-1/5-4/7-7/8-4/9-10/11+3/1
-1/5-4/7-7/8-4/9-10/11+3/1
-2/5-3/7-3/8-1/9-5/11-3/13+2/1...

result:

wrong answer Sums do not match for modulus 8809877585262195773