QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#746263 | #9628. 骰子 | kindow# | AC ✓ | 0ms | 3576kb | C++20 | 661b | 2024-11-14 14:02:34 | 2024-11-14 14:02:35 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
ll n, m;
cin >> n >> m;
if(n != 1 && m != 1){
cout << n * m * 6 << '\n';
}
vector<int> v(4);
if(n == 1){
int num = m / 4;
int cur = m % 4;
v[1] = 6;
v[2] = 9;
v[3] = 10;
cout << num * 14 + v[cur] << '\n';
}
else if(m == 1){
int num = n / 4;
int cur = n % 4;
v[1] = 6;
v[2] = 8;
v[3] = 9;
cout << num * 14 + v[cur] << '\n';
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int t = 1;
// cin >> t;
while(t--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3544kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'