QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#736350#9628. 骰子cddAC ✓0ms3652kbC++20744b2024-11-12 10:18:012024-11-12 10:18:01

Judging History

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

  • [2024-11-12 10:18:01]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3652kb
  • [2024-11-12 10:18:01]
  • 提交

answer

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

// #define int long long

typedef pair<int, int> pii;
typedef long long LL;
typedef unsigned long long uLL;

const int inf32 = 1e9;
const LL inf64 = 1e18;

LL read() {
    LL x = 0, w = 1;
    char ch = 0;
    while (ch < '0' || ch > '9') {
        if (ch == '-') w = 0;
        ch = getchar();
    }
    while (ch >= '0' && ch <= '9') {
        x = x * 10 + (ch ^ 48);
       ch = getchar();
    }
    return w ? x : -x;
}

int main()
{
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(0);

    int T = 1;
    // T = read();
    while (T--) {
        int n, m;
        n = read(); m = read();

        cout << 6 * n * m << "\n";
    }

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 2

output:

24

result:

ok single line: '24'

Test #2:

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

input:

1000 1000

output:

6000000

result:

ok single line: '6000000'

Test #3:

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

input:

987 654

output:

3872988

result:

ok single line: '3872988'