QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#757531#9628. 骰子Martian148#AC ✓0ms3676kbC++20469b2024-11-17 09:38:302024-11-17 09:38:32

Judging History

你现在查看的是最新测评结果

  • [2024-11-17 09:38:32]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3676kb
  • [2024-11-17 09:38:30]
  • 提交

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;
}

Details

Tip: Click on the bar to expand more detailed information

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'