QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #745594 | #9628. 骰子 | slmhh | AC ✓ | 0ms | 3648kb | C++23 | 359b | 2024-11-14 10:43:58 | 2024-11-14 10:43:58 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> PII;
const int N = 3e5 + 10,b = 61,mod = 998244353;
int main(){
ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
ll T = 1;
// cin >> T;
while(T--){
ll n,m;
cin >> n >> m;
cout << n * m * 6 << "\n";
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
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: 3648kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3584kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'