oj.uz

Submission #693679

# Submission time Handle Problem Language Result Execution time Memory
693679 2023-02-03T06:52:55 Z zeroesandones Cryptography (NOI20_crypto) C++17
11 / 100
 33 ms 4584 KB 
#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;

#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define sp " "

#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb emplace_back

const int mod = 1e9 + 7;

ll add(ll x, ll y) {
    return (x % mod + y % mod) % mod;
}

ll factorial(ll n) {
    ll res = 1;
    while(n) {
        res *= n;
        res %= mod;
        --n;
    }

    return (res % mod);
}

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

    vi a(n);
    FOR(i, 0, n)
        cin >> a[i];

    ll k = a[0];

    ll ans = 0;
    ans = (((k - 1) * factorial(n - 1)) % mod + 1) % mod;

    cout << ans << nl;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 25 ms 2644 KB Output is correct
3 Correct 27 ms 4584 KB Output is correct
4 Correct 26 ms 4568 KB Output is correct
5 Correct 27 ms 4584 KB Output is correct
6 Correct 33 ms 4564 KB Output is correct
7 Correct 25 ms 4584 KB Output is correct
8 Correct 27 ms 4556 KB Output is correct
9 Correct 31 ms 4576 KB Output is correct
10 Correct 23 ms 4556 KB Output is correct
11 Correct 27 ms 4564 KB Output is correct
12 Correct 25 ms 4576 KB Output is correct
13 Correct 26 ms 4572 KB Output is correct
14 Correct 24 ms 4572 KB Output is correct
15 Correct 24 ms 4548 KB Output is correct
16 Correct 29 ms 4564 KB Output is correct
17 Correct 23 ms 4580 KB Output is correct
18 Correct 24 ms 4572 KB Output is correct
19 Correct 26 ms 4576 KB Output is correct
20 Correct 25 ms 4564 KB Output is correct
21 Correct 25 ms 4548 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 25 ms 2644 KB Output is correct
3 Correct 27 ms 4584 KB Output is correct
4 Correct 26 ms 4568 KB Output is correct
5 Correct 27 ms 4584 KB Output is correct
6 Correct 33 ms 4564 KB Output is correct
7 Correct 25 ms 4584 KB Output is correct
8 Correct 27 ms 4556 KB Output is correct
9 Correct 31 ms 4576 KB Output is correct
10 Correct 23 ms 4556 KB Output is correct
11 Correct 27 ms 4564 KB Output is correct
12 Correct 25 ms 4576 KB Output is correct
13 Correct 26 ms 4572 KB Output is correct
14 Correct 24 ms 4572 KB Output is correct
15 Correct 24 ms 4548 KB Output is correct
16 Correct 29 ms 4564 KB Output is correct
17 Correct 23 ms 4580 KB Output is correct
18 Correct 24 ms 4572 KB Output is correct
19 Correct 26 ms 4576 KB Output is correct
20 Correct 25 ms 4564 KB Output is correct
21 Correct 25 ms 4548 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Incorrect 1 ms 340 KB Output isn't correct
24 Halted 0 ms 0 KB -

Subtask #8
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -