QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#741479 | #9628. 骰子 | liaoyd | AC ✓ | 0ms | 3704kb | C++23 | 638b | 2024-11-13 14:28:18 | 2024-11-13 14:28:19 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vii vector<vi>
#define pb push_back
#define pir pair<int,int>
const int P = 1e9 + 7;
const int N = 1e6+7;
const int inf = 0x3f3f3f3f3f3f3f3f;//longlong
const int ing = 1e18;
const int mod = 1e9+7;
int n,m;
int ax, bx,ay,by;
void solve()
{
cin>>n>>m;
if(n*m==1){
cout<<"6\n";
}
else if(n*m==2&&n==1){
cout<<"9\n";
}
else if(n*m==2&&m==1){
cout<<"8\n";
}
else cout<<n*m*6<<"\n";
}
signed main()
{
cin.tie(0)->sync_with_stdio(0);
int _ = 1;
//cin >> _;
while (_--)
{
solve();
}
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'