QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #747405 | #9628. 骰子 | snow_miku# | AC ✓ | 0ms | 3640kb | C++14 | 406b | 2024-11-14 17:06:31 | 2024-11-14 17:06:32 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
int main()
{
int n, m;
cin >> n >> m;
if(m > 1 && n > 1) {
cout << 6 * n * m;
return 0;
}
if(m > n) swap(n, m);
LL ans = (n / 4) * 14;
if(n % 4 == 0) cout << ans;
else if(n % 4 == 1) cout << ans + 6;
else if(n % 4 == 2) cout << ans + 11;
else cout << ans + 13;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3556kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'