QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#780909 | #9628. 骰子 | _Strelitzia# | AC ✓ | 0ms | 3724kb | C++23 | 505b | 2024-11-25 13:58:20 | 2024-11-25 13:58:21 |
Judging History
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'