QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#740276 | #9628. 骰子 | DiaoTianhao# | AC ✓ | 1ms | 3696kb | C++14 | 392b | 2024-11-13 08:17:39 | 2024-11-13 08:17:40 |
Judging History
answer
#include <bits/stdc++.h>
#define FL(i, a, b) for (int i = (a); i <= (b); ++i)
#define FR(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;
typedef long long ll;
constexpr ll N = 1e3 + 10;
ll n, m, ans;
int a[4][4] = {
{6, 3, 1, 4},
{2, 2, 2, 2},
{1, 4, 6, 3},
{5, 5, 5, 5}
};
int main() {
cin >> n >> m;
cout << n * m * 6;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3692kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'