QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #753770 | #9628. 骰子 | Icedpiggy# | AC ✓ | 0ms | 3768kb | C++20 | 378b | 2024-11-16 13:36:26 | 2024-11-16 13:36:34 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define i64 long long
inline i64 rd()
{
i64 num=0;char ch=getchar();bool op=0;
for(;!isdigit(ch);ch=getchar())if(ch=='-')op=1;
for(;isdigit(ch);ch=getchar())num=num*10+(ch-'0');
return op?-num:num;
}
const int N=1e5+10;
int n,m;
int main()
{
n=rd(),m=rd();
printf("%d",n*m*6);
return 0;
}
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: 0ms
memory: 3760kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3768kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'