QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#876217#7698. ISBN ConversionTeapot#WA 1ms3712kbC++202.5kb2025-01-30 18:40:342025-01-30 18:40:37

Judging History

This is the latest submission verdict.

  • [2025-01-30 18:40:37]
  • Judged
  • Verdict: WA
  • Time: 1ms
  • Memory: 3712kb
  • [2025-01-30 18:40:34]
  • Submitted

answer

/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double ld;
typedef __int128_t ill;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif


int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll t;
    cin >> t;
    FOR(_,0,t)
    {
        string s;
        cin >> s;
        ll c = 0;
        ll n = sz(s);
        bool t = true;
        FOR(i,0,n)
            if(s[i] == '-')
                c++;
        if(c == 3 && s[n-2] != '-')
            t = false;
        if(s[n-1] == '-' || s[0] == '-')
            t = false;
        FOR(i,1,n)
            if(s[i] == s[i-1] && s[i] == '-')
                t = false;
        c = 10;
        ll su = 0;
        FOR(i,0,n)
        {
            if(s[i] >= '0' && s[i] <= '9')
            {
                su += (s[i]-'0')*c;
                c--;
            }
            if(s[i] == 'X')
            {
                su += 10*c;
                c--;
            }
        }
        if(su%11 != 0)
            t = false;
        if(!t)
        {
            cout << "invalid" << endl;
            continue;
        }
        cout << "978-";
        FOR(i,0,n-1)
            cout << s[i];
        c = 3;
        su = 38;
        FOR(i,0,n-1)
        {
            if(s[i] >= '0' && s[i] <= '9')
            {
                if(c % 2 == 0)
                    su += (s[i]-'0');
                else
                    su += 3 * (s[i]-'0');
                c++;
            }
        }
        su%= 10;
        if(su == 0)
            cout << 0 << endl;
        else
            cout << 10 - su << endl;
    }
}

詳細信息

Test #1:

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

input:

4
3-540-4258-02
039428013X
3-540-42580-2
0-14-028333-3

output:

invalid
978-0394280134
978-3-540-42580-9
invalid

result:

ok 4 lines

Test #2:

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

input:

25
----------
-----------
------------
-------------
XXXXXXXXXX
XXXXXXXXXXX
XXXXXXXXXXXX
XXXXXXXXXXXXX
---------X
----------X
-----------X
01234567890
012345678901
0123456789012
-0123456789-
0123456789-
-0123456789
01--23456789
012345678--9
0123456789--
--0123456789
98765432-1
987-654-321
87-645-32-...

output:

invalid
invalid
invalid
invalid
978-XXXXXXXXX2
978-XXXXXXXXXX2
invalid
invalid
invalid
invalid
invalid
978-01234567897
invalid
invalid
invalid
invalid
invalid
invalid
invalid
invalid
invalid
978-98765432-0
978-987-654-320
978-87-645-32-5
invalid

result:

wrong answer 5th lines differ - expected: 'invalid', found: '978-XXXXXXXXX2'