QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#746572 | #9628. 骰子 | Microperson# | AC ✓ | 0ms | 3616kb | C++20 | 441b | 2024-11-14 15:01:23 | 2024-11-14 15:01:23 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1000007;
int n,m;
void solve( ){
cin>>n>>m;
cout<<m * n * 6<<'\n';
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
ll T=1;
// cin >> T;
while(T--){
solve();
}
}
/*
3
4 2
3 6
1 3
2 7
5 6
2 5
2 4
6 8
9 4
3 6
3 4
3 5
7 12
6 15
6 9
11 14
1 5
2 5
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3616kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3592kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'