QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #741362 | #9628. 骰子 | Tom22l | AC ✓ | 0ms | 3572kb | C++23 | 493b | 2024-11-13 14:11:29 | 2024-11-13 14:11:30 |
Judging History
answer
#include<bits/stdc++.h>
#define eps 0.00000001
#define int long long
using namespace std;
int Read(){
int x=0;
char ch=getchar();bool f=0;
while(ch<'0'||ch>'9') if(ch=='-')f=1,ch=getchar(); else if(ch==EOF)return 0; else ch=getchar();
while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
return f?-x:x;
}
char s1[100005],s2[100005];
signed main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int n=Read(),m=Read();
cout<<n*m*6;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3456kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3496kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'