QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#736691 | #9628. 骰子 | Zxyoul# | AC ✓ | 0ms | 3716kb | C++17 | 298b | 2024-11-12 12:36:19 | 2024-11-12 12:36:20 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn= 1e6+5;
void solve()
{
ll n,m;cin>>n>>m;
cout<<n*m*6<<'\n';
}
int main()
{
ios::sync_with_stdio(0), cin.tie(00) ;
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: 3716kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'