QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#736350 | #9628. 骰子 | cdd | AC ✓ | 0ms | 3652kb | C++20 | 744b | 2024-11-12 10:18:01 | 2024-11-12 10:18:01 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
// #define int long long
typedef pair<int, int> pii;
typedef long long LL;
typedef unsigned long long uLL;
const int inf32 = 1e9;
const LL inf64 = 1e18;
LL read() {
LL x = 0, w = 1;
char ch = 0;
while (ch < '0' || ch > '9') {
if (ch == '-') w = 0;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch ^ 48);
ch = getchar();
}
return w ? x : -x;
}
int main()
{
cin.tie(0); cout.tie(0);
ios::sync_with_stdio(0);
int T = 1;
// T = read();
while (T--) {
int n, m;
n = read(); m = read();
cout << 6 * n * m << "\n";
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'