QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#737504 | #9628. 骰子 | MOQEE# | AC ✓ | 0ms | 3652kb | C++20 | 656b | 2024-11-12 16:01:15 | 2024-11-12 16:01:20 |
Judging History
answer
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("O2")
using namespace std;
#define int long long
#define ll long long
#define llu unsigned long long
#define endl "\n"
typedef pair<int, int> PII;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
const long long inf = 1LL << 60;
const int mod = 998244353;
const int N = 1e6 + 7;
void solve()
{
int n, m;
cin >> n >> m;
cout << n * m * 6 << endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
int T = 1;
// cin >> T;
while (T--)
solve();
return 0;
}
详细
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: 3600kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'