QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#792761 | #9628. 骰子 | happy_lazier# | AC ✓ | 1ms | 3712kb | C++20 | 382b | 2024-11-29 13:54:11 | 2024-11-29 13:54:13 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i,l,r) for(ll i=l;i<=r;++i)
#define rep_(i,r,l) for(ll i=r;i>=l;--i)
const ll N = 2e5 + 7;
const ll P = 1e9 + 7;
void solve() {
ll n, m;
cin >> n >> m;
cout << n * m * 6ll;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T(1);
//cin >> T;
while (T--) {
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3712kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 1ms
memory: 3672kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'