QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#741243 | #9628. 骰子 | yzhx# | AC ✓ | 0ms | 3620kb | C++20 | 510b | 2024-11-13 13:56:07 | 2024-11-13 13:56:08 |
Judging History
answer
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
#define int long long
const int a1[5] = {6, 3, 1, 4};
const int a2[5] = {6, 2, 1, 5};
signed main() {
int n, m, ans = 0;
std::cin >> n >> m;
if (n == 1) {
for (int i = 0; i < m; i++) ans += a1[i % 4];
} else if (m == 1) {
for (int i = 0; i < n; i++) ans += a2[i % 4];
} else {
ans = n * m * 6;
}
std::cout << ans << std::endl;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3540kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'