QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#757531 | #9628. 骰子 | Martian148# | AC ✓ | 0ms | 3676kb | C++20 | 469b | 2024-11-17 09:38:30 | 2024-11-17 09:38:32 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MAXN = 2e5 + 5;
ll n, m, f[5] = {0, 6, 9, 10}, g[5] = {0, 6, 8, 9};
int main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n >> m;
if(n == 1){
cout << f[m % 4] + (m / 4) * 14 << "\n";
}
else if(m == 1){
cout << g[m % 4] + (m / 4) * 14 << "\n";
}
else{
cout << n * m * 6 << "\n";
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'