QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#736718 | #9628. 骰子 | kjhhjki# | AC ✓ | 0ms | 3600kb | C++20 | 344b | 2024-11-12 12:49:44 | 2024-11-12 12:49:45 |
Judging History
answer
#include <bits/stdc++.h>
using i64 = long long;
using f64 = long double;
void solve()
{
int n, m;
std::cin >> n >> m;
std::cout << n * m * 6ll << '\n';
}
int main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
int T = 1;
// std::cin >> T;
while(T --) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3588kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'