QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #765268 | #9627. 算术 | Heenpei# | AC ✓ | 1ms | 3720kb | C++23 | 2.5kb | 2024-11-20 13:30:04 | 2024-11-20 13:30:04 |
Judging History
answer
#include<bits/stdc++.h>
#define endl '\n'
#define ll long long
#define Int __int128
#define pb push_back
#define eb emplace_back
#define MAX_LOG 21
#define ff first
#define ss second
#define M (int)1e4+10
#define ull unsigned long long
#define MAX_LOG 21
//#define double long double
using namespace std;
const double PI=3.1415926535897932385;
const int IIMIN=-2147483648;
//const ll p=998244353;
const ll mod=998244353;
const int INF=0x3f3f3f3f;
typedef pair<ll,ll> PLL;
typedef pair<double,double>PFF;
ll gcd(ll a,ll b)
{
if(b) while((a%=b)&&(b%=a));
return a+b;
}//最大公约数函数
ll spid(ll a,ll b,ll p)
{
ll ans=1;
while(b)
{
if(b&1)ans=ans*a%p;
b>>=1;
a=a*a%p;
}
return ans;
}//快速幂函数
///小香猪的代码块·香香猪猪惹人怜~
///秋雨想睡觉
const ll N =4e5+10;
ll a[11];
void solve()
{
a[10]=0;
for(int i=1;i<=9;i++)cin>>a[i];
ll now=a[1];
if(a[1]>=a[2]){
a[3]+=a[2];
a[1]-=a[2];
a[2]=0;
now=a[1];
}
else{
a[3]+=a[1];
a[2]-=a[1];
now=0;
a[1]=0;
}
// for(int i=9;i>=3;i--)
// {
// ll mina=min(now,a[i-1]);
// a[i-1]-=mina;
// a[i]+=mina;
// now-=mina;
// }
// cout<<now<<'\n';
ll ans=1;
ll add=now/3;
a[3]+=add;
now-=add*3;
if(now==2){
a[2]++;
}
else if(now==1){
for(int i=2;i<=9;i++)
{
if(a[i])
{
if(i==9){
a[10]++;
a[9]--;
break;
}
else{
a[i]--;
a[i+1]++;
break;
}
}
}
}
// if(now&1)
// for(int i=2;i<9;i++)
// {
// if(a[i])
// {
// a[i]--;
// a[i+1]++;
// break;
// }
// }
// for(int i=2;i<=10;i++)cout<<a[i]<<' ';
// cout<<'\n';
for(int i=2;i<=10;i++)ans=ans*spid(i,a[i],mod)%mod;
cout<<ans<<'\n';
}
///秋雨睡觉了
//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
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t=1;
cin>>t;
while(t--)
{
solve();
}
}
///记忆是梦的开场白
/*
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3720kb
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: 0
Accepted
time: 1ms
memory: 3660kb
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:
376701872 321820208 765709043 819408880 639261805 521201354 7172464 780360907 240853384 151457742 298466126 416189734 124742738 161566750 493291429 481038778 409158325 951979430 783007793 438976523 440485591 163247072 78098984 275527515 308024444 168349368 423889166 168234582 827159852 914298923 465...
result:
ok 1000 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
1000 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 2 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 1 0 0 0 0 0 1 0 0 1 0 0 0...
output:
1 2 3 4 5 6 7 8 9 2 3 4 5 6 7 8 9 10 4 6 8 10 12 14 16 18 9 12 15 18 21 24 27 16 20 24 28 32 36 25 30 35 40 45 36 42 48 54 49 56 63 64 72 81 53234520 78732 944784 17744840 53234520 688747536 141958720 19131876 4374 9726857 668738521 35489680 11664 79851780 8748 104630853 551437603 234594227 96996101...
result:
ok 1000 lines