QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #776595 | #9628. 骰子 | RUOHUI | AC ✓ | 1ms | 3636kb | C++20 | 398b | 2024-11-23 19:36:21 | 2024-11-23 19:36:21 |
Judging History
answer
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int N = 2e6 + 10, M = 2e6 + 10, mod = 1e9 + 7, inf = 1e18;
void solve()
{
int n,m;
cin>>n>>m;
cout<<n*m*6<<"\n";
}
signed main()
{
// freopen("in.t2xt", "r", stdin);
// freopen("out.txt", "w", stdout);
int T = 1;
//cin >> T;
while (T--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3608kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 1ms
memory: 3636kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'