QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#743284#9628. 骰子BaseAI#AC ✓0ms3688kbC++23666b2024-11-13 18:50:232024-11-13 18:50:27

Judging History

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

  • [2024-11-13 18:50:27]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3688kb
  • [2024-11-13 18:50:23]
  • 提交

answer

#include<bits/stdc++.h>

using namespace std;
int dx[]={6,3,1,4};
int dy[]={6,2,1,5};
void solve()
{
    int n,m;
    cin>>n>>m;
    if(n>1&&m>1)
    {
        cout<<n*m*6<<'\n';
    }
    else if(n==1)
    {
        int ans=0;
        for(int i=0;i<m;i++)
        {
            ans+=dx[i%4];
        }
        cout<<ans<<'\n';
    }
    else
    {
        int ans=0;
        for(int i=0;i<n;i++)
        {
            ans+=dy[i%4];
        }
        cout<<ans<<'\n';
    }
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int _=1;
    // cin>>_;
    while(_--)
    {
        solve();
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 2

output:

24

result:

ok single line: '24'

Test #2:

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

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'