QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#750225#9628. 骰子ucup-team2179#AC ✓0ms3696kbC++20470b2024-11-15 13:31:192024-11-15 13:31:19

Judging History

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

  • [2024-11-15 13:31:19]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3696kb
  • [2024-11-15 13:31:19]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;

int pre(int n){
    return n * (n + 1) / 2;
}

int dx[]={6,3,1,4};
int dy[] ={6,2,1,5};

int main(){
    int n,m;
    cin>>n>>m;
    if(n==1){
        int ans = 0;
        for (int i = 0; i < m;i++)ans+=dx[i%4];
        cout << ans;
    }
    else if(m==1){
        int ans=0;
        for(int i=0;i<n;i++)
            ans += dy[i%4];
        cout << ans;
    }
    else
        cout << n * m * 6;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3696kb

input:

2 2

output:

24

result:

ok single line: '24'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

1000 1000

output:

6000000

result:

ok single line: '6000000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3688kb

input:

987 654

output:

3872988

result:

ok single line: '3872988'