Submission #26155443


Source Code Expand

#include <bits/stdc++.h>

constexpr int P = 998244353;
using i64 = long long;
// assume -P <= x < 2P
int norm(int x) {
    if (x < 0) {
        x += P;
    }
    if (x >= P) {
        x -= P;
    }
    return x;
}
template<class T>
T power(T a, int b) {
    T res = 1;
    for (; b; b /= 2, a *= a) {
        if (b % 2) {
            res *= a;
        }
    }
    return res;
}
struct Z {
    int x;
    Z(int x = 0) : x(norm(x)) {}
    int val() const {
        return x;
    }
    Z operator-() const {
        return Z(norm(P - x));
    }
    Z inv() const {
        assert(x != 0);
        return power(*this, P - 2);
    }
    Z &operator*=(const Z &rhs) {
        x = i64(x) * rhs.x % P;
        return *this;
    }
    Z &operator+=(const Z &rhs) {
        x = norm(x + rhs.x);
        return *this;
    }
    Z &operator-=(const Z &rhs) {
        x = norm(x - rhs.x);
        return *this;
    }
    Z &operator/=(const Z &rhs) {
        return *this *= rhs.inv();
    }
    friend Z operator*(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res *= rhs;
        return res;
    }
    friend Z operator+(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res += rhs;
        return res;
    }
    friend Z operator-(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res -= rhs;
        return res;
    }
    friend Z operator/(const Z &lhs, const Z &rhs) {
        Z res = lhs;
        res /= rhs;
        return res;
    }
};

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int N;
    std::cin >> N;
    
    Z f[10];
    int A0;
    std::cin >> A0;
    f[A0] = 1;
    
    for (int i = 1; i < N; i++) {
        int x;
        std::cin >> x;
        Z g[10];
        for (int y = 0; y < 10; y++) {
            g[x * y % 10] += f[y];
            g[(x + y) % 10] += f[y];
        }
        std::copy(g, g + 10, f);
    }
    
    for (int i = 0; i < 10; i++) {
        std::cout << f[i].val() << "\n";
    }
    
    return 0;
}

Submission Info

Submission Time
Task D - FG operation
User jiangly
Language C++ (GCC 9.2.1)
Score 400
Code Size 2106 Byte
Status AC
Exec Time 19 ms
Memory 3596 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 20
Set Name Test Cases
Sample example0.txt, example1.txt
All 000.txt, 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, example0.txt, example1.txt
Case Name Status Exec Time Memory
000.txt AC 4 ms 3496 KiB
001.txt AC 2 ms 3436 KiB
002.txt AC 3 ms 3440 KiB
003.txt AC 14 ms 3596 KiB
004.txt AC 7 ms 3444 KiB
005.txt AC 3 ms 3572 KiB
006.txt AC 16 ms 3516 KiB
007.txt AC 9 ms 3496 KiB
008.txt AC 13 ms 3568 KiB
009.txt AC 2 ms 3592 KiB
010.txt AC 15 ms 3440 KiB
011.txt AC 15 ms 3492 KiB
012.txt AC 13 ms 3492 KiB
013.txt AC 19 ms 3536 KiB
014.txt AC 16 ms 3532 KiB
015.txt AC 13 ms 3492 KiB
016.txt AC 15 ms 3492 KiB
017.txt AC 17 ms 3488 KiB
example0.txt AC 3 ms 3512 KiB
example1.txt AC 2 ms 3564 KiB