QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#745726 | #9628. 骰子 | MrLi | AC ✓ | 0ms | 3684kb | C++20 | 403b | 2024-11-14 11:15:51 | 2024-11-14 11:15:55 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pii;
#define endl "\n"
const int N=2e5+5;
int a[N],b[N];
double eps=1e-6;
void solve()
{
int x,y;
cin>>x>>y;
cout<<x*y*6<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t=1;
//cin>>t;
while(t--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3552kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'