QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#758187 | #9627. 算术 | Ail_ijyq# | WA | 3ms | 3728kb | C++20 | 962b | 2024-11-17 16:36:04 | 2024-11-17 16:36:04 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
const int MOD = 998244353;
using namespace std;
int qmi(int a,int k,int q)
{
int num=1;
while(k)
{
if(k&1) num = num * a % q;
a = a * a % q;
k >>= 1;
}
return num;
}
void solve()
{
int x;
vector<int> a(11,0);
for(int i=1;i<=9;i++) cin>>a[i];
int add = min(a[1],a[2]);
a[3]+=add;
a[2]-=add;
a[1]-=add;
a[3] += a[1]/3;
a[1] %= 3;
a[2] += a[1]/2;
a[2] %= 2;
if(a[1]==1)
{
for(int i=2;i<=9;i++)
{
if(a[i]!=0)
{
a[i]--,a[i+1]++;
break;
}
}
}
int res=1;
for(int i=1;i<=10;i++)
{
res = res * qmi(i , a[i] ,MOD) % MOD;
}
cout<<res<<endl;
}
signed main()
{
int t;
cin>>t;
while(t--)
{
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3512kb
input:
7 5 3 0 0 0 0 0 0 0 4 1 1 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 2 99 88 77 66 55 44 33 22 11 100 90 80 70 60 50 40 30 20
output:
54 108 1 10 90 90553232 143532368
result:
ok 7 lines
Test #2:
score: -100
Wrong Answer
time: 3ms
memory: 3728kb
input:
1000 22 80 50 23 35 71 81 70 96 40 33 36 2 51 52 96 5 32 56 35 85 13 58 80 26 14 31 60 21 8 19 79 5 94 44 33 85 55 10 59 76 98 28 22 69 14 72 40 14 100 68 5 18 69 95 42 51 0 32 97 37 34 85 54 33 18 40 34 10 72 72 68 81 47 80 23 23 68 40 3 71 58 7 36 79 89 83 5 68 16 30 3 82 79 35 28 30 55 88 17 86 2...
output:
635566079 321820208 765709043 819408880 639261805 60370661 7172464 780360907 240853384 151457742 298466126 284901715 124742738 529279137 493291429 880925897 409158325 951979430 325762185 612531080 440485591 163247072 78098984 318442967 308024444 168349368 423889166 90356315 827159852 914298923 46521...
result:
wrong answer 1st lines differ - expected: '376701872', found: '635566079'