QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#738347 | #9628. 骰子 | 1532028583# | AC ✓ | 0ms | 3592kb | C++20 | 821b | 2024-11-12 18:47:10 | 2024-11-12 18:47:18 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
void solve()
{
int ans=0,a[4]={6,3,1,4},b[4]={6,2,1,5};
int n,m;
cin>>n>>m;
if(n==1&m==1)cout<<6;
else if(n==1)
{
int t=0;
for(int i=1;i<=m;i++)
{
ans+=a[t];
t++;
t%=4;
}
cout<<ans;
}
else if(m==1)
{
int t=0;
for(int i=1;i<=n;i++)
{
ans+=b[t];
t++;
t%=4;
}
cout<<ans;
}
else if(m>1&&m>1)
{
cout<<n*m*6;
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin >> T;
while (T--) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'