QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#787674 | #9628. 骰子 | Lonelyper# | AC ✓ | 0ms | 3644kb | C++17 | 332b | 2024-11-27 13:58:18 | 2024-11-27 13:58:22 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
long long n, m;
void Lonelyper(){
cin >> n >> m;
long long ans = (n * m) * 6LL;
cout << ans << endl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
while(t --) Lonelyper();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3564kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'