QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#751246 | #9628. 骰子 | LittleXi# | AC ✓ | 0ms | 3684kb | C++20 | 523b | 2024-11-15 17:42:46 | 2024-11-15 17:42:46 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n,m;cin>>n>>m;
if(min(m,n) >=2){
cout<<n*m*6;return;
}
if(n==1){
int ans =0;
int dx[4] = {6,3,1,4};
for(int i =0;i<m;i++){
ans += dx[i%4];
}
cout<<ans;
}
else if(m==1){
int ans =0;
int dx[4] = {6,2,1,5};
for(int i =0;i<m;i++){
ans += dx[i%4];
}
cout<<ans;
}
}
int main(){
solve();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3640kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'