QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#753749 | #9628. 骰子 | steph_hl | AC ✓ | 0ms | 3704kb | C++23 | 648b | 2024-11-16 13:33:37 | 2024-11-16 13:33:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ll __int128
#define PII pair<int,int>
#define endl '\n'
#define mk make_pair
#define IOS ios::sync_with_stdio(false),cin.tie(nullptr),cout.tie(nullptr);
#define Pi acos(-1.0)
#define ull unsigned long long
int ls(int p){ return (p << 1) ;}
int rs(int p){ return (p << 1 | 1) ;}
inline int lowbit(int x) { return x & (-x) ;}
const int mod = 998244353;
const int N = 2e5 + 5;
void solve() {
int n ,m;
cin >> n >> m;
cout << 6 * (n * m) << endl;
}
signed main(){
IOS
int O_O = 1;
// cin >> O_O;
while(O_O--) solve();
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3704kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3568kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'