QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#752890 | #9628. 骰子 | D12EQD# | AC ✓ | 0ms | 3628kb | C++17 | 851b | 2024-11-16 10:18:18 | 2024-11-16 10:18:19 |
Judging History
answer
#include <bits/stdc++.h>
#define min(a,b) (a > b ? b : a)
#define max(a,b) (a < b ? b : a)
#define YES (cout << "YES" << endl)
#define NO (cout << "NO" << endl)
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define mem(a,b) memset(a,b,sizeof(a))
#define rrep(a, b, c) for (a = b; a >= c; a--)
#define rep(a, b, c) for (a = b; a <= c; a++)
#define int long long
#define IOS ios::sync_with_stdio(0); cout.tie(0);
using namespace std;
typedef double db;
typedef pair<int,int> pii;
typedef array <int,3> a3;
const db eps = 1e-7;
const int inf = 0x3f3f3f3f3f3f3f3f;
const int N = 200010;
void solve(){
int n, m;
cin >> n >> m;
cout << n * m * 6 << endl;
}
signed main(){
cin.tie(0);
int T = 1;
//cin >> T;
while (T --){
solve();
}
// system("pause");
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'