QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#742733 | #9628. 骰子 | Nuyoah# | AC ✓ | 0ms | 3640kb | C++23 | 492b | 2024-11-13 17:11:54 | 2024-11-13 17:11:56 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define ull unsigned long long
#define PII pair<int, int>
#define fi first
#define se second
#define inf 0x3f3f3f3f3f3f3f3f
const int N=2e5+10,mod=998244353,P=131;
void solve()
{
int n,m;
cin>>n>>m;
cout<<n*m*6<<endl;
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
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: 3556kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'