QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#736547 | #9628. 骰子 | chenjiaqiy | AC ✓ | 0ms | 3652kb | C++20 | 652b | 2024-11-12 11:42:40 | 2024-11-12 11:42:45 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
// #define int long long
#define ll long long
#define endl '\n'
#define all(a) a.begin(), a.end()
#define pb push_back
#define x first
#define y second
#define debug(_x) cout << #_x << '=' << _x << endl
typedef pair<int, int> PII;
using i64 = long long;
const int mod = 1e9 + 7;
const int N = 2e5 + 10;
ll a[N];
int b[N], c[N];
void solve()
{
int n, m;
cin >> n >> m;
cout << n * m * 6 << endl;
}
int main()
{
/*ios::sync_with_stdio(false);
cin.tie(nullptr);*/
int _ = 1;
// cin >> _;
while (_--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3576kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3516kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'