QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#742031 | #9628. 骰子 | Zeoy# | AC ✓ | 0ms | 3772kb | C++20 | 670b | 2024-11-13 15:40:49 | 2024-11-13 15:40:49 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n,m; cin>>n>>m;
if(n==1||m==1) {
int ans=0;
vector<int> a(4);
vector<int> b(4);
a[0]=6;
a[1]=3;
a[2]=1;
a[3]=4;
b[0]=6;
b[1]=2;
b[2]=1;
b[3]=5;
ans=6;
for(int i=1;i<m;i++) ans+=a[i%4];
for(int i=1;i<n;i++) ans+=b[i%4];
cout<<ans<<"\n";
return;
}
else cout<<n*m*6<<"\n";
}
signed main() {
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int _=1; //cin>>_;
while(_--) solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3772kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'