QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#796522#9628. 骰子Catbiscuit#AC ✓0ms3832kbC++20826b2024-12-01 20:21:122024-12-01 20:21:13

Judging History

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

  • [2024-12-01 20:21:13]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3832kb
  • [2024-12-01 20:21:12]
  • 提交

answer

#include <iostream>
#include <algorithm>
#include <map>
#include <cstring>
#include <string>
#include <vector>
#include <cctype>
#include <cmath>
#include <queue>
#include <set>
#include <functional>
#include <unordered_map>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PLL;
#define qwq ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define tcase      \
    LL t = read(); \
    while (t--)

LL read()
{
    LL sum = 0, fl = 1;
    int ch = getchar();
    for (; !isdigit(ch); ch = getchar())
        if (ch == '-')
            fl = -1;
    for (; isdigit(ch); ch = getchar())
        sum = sum * 10 + ch - '0';
    return sum * fl;
}

void solve()
{
    LL n = read(), m = read();
    printf("%lld\n", n * m * 6);
}

int main()
{

    solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 2

output:

24

result:

ok single line: '24'

Test #2:

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

input:

1000 1000

output:

6000000

result:

ok single line: '6000000'

Test #3:

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

input:

987 654

output:

3872988

result:

ok single line: '3872988'