QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#737181#9628. 骰子ehdxbcAC ✓0ms3648kbC++20656b2024-11-12 14:56:512024-11-12 14:56:53

Judging History

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

  • [2024-11-12 14:56:53]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3648kb
  • [2024-11-12 14:56:51]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> PII;
#define int long long
const int mod = 998244353;
void add(int &x, int y) {
   x += y;
   x = (x % mod + mod) % mod;
}
int mul(int x, int y) {
   return 1ll * x * y % mod;
}
int qmi(int x, int y) {
   int res = 1;
   while (y) {
      if (y & 1) res = mul(res, x);
      x = mul(x, x);
      y >>= 1;
   }
   return res;
}
void solve() {
   int n, m;
   cin >> n >> m;
   cout << 6 * n * m << endl;
}
signed main() {
   ios::sync_with_stdio(false);
   cin.tie(0);
   cout.tie(0);
   int t = 1;
   // cin >> t;
   while (t--) {
      solve();
   }
}

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: 3648kb

input:

1000 1000

output:

6000000

result:

ok single line: '6000000'

Test #3:

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

input:

987 654

output:

3872988

result:

ok single line: '3872988'