QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#780909#9628. 骰子_Strelitzia#AC ✓0ms3724kbC++23505b2024-11-25 13:58:202024-11-25 13:58:21

Judging History

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

  • [2024-11-25 13:58:21]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3724kb
  • [2024-11-25 13:58:20]
  • 提交

answer

#include <bits/stdc++.h>
#define lowbit(x) (x & -x)
#define int long long
#define lc (p << 1)
#define rc (p << 1 | 1)
using namespace std;
typedef pair<int, int> PII;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 2e5 + 5, M = 1e6 + 5, INF = 0x3f3f3f3f, mod = 998244353;

int T = 1, n, m;

void solve() {
	cin >> n >> m;
	cout << n * m * 6 << endl;
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	
//	cin >> T;
	while (T--) solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 2

output:

24

result:

ok single line: '24'

Test #2:

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

input:

1000 1000

output:

6000000

result:

ok single line: '6000000'

Test #3:

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

input:

987 654

output:

3872988

result:

ok single line: '3872988'