QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#797366 | #9628. 骰子 | 1903331632 | AC ✓ | 0ms | 3724kb | C++23 | 771b | 2024-12-02 21:37:47 | 2024-12-02 21:37:47 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
// #define int long long
#define endl '\n'
#define double long double
const int N = 1e6 + 10;
const int mod = 998244353;
int n, m;
void solve()
{
cin >> n >> m;
if (n == 1 && m == 1)
{
cout << 6 << endl;
}
else if (n == 1 && m == 2)
{
cout << 9 << endl;
}
else if (n == 2 && m == 1)
{
cout << 8 << endl;
}
else if (n == 2 && m == 2)
{
cout << 24 << endl;
}
else
{
cout << n * m * 6 << 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: 3636kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3724kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'