QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#740660 | #9628. 骰子 | NoT1m3Cons1d3r | AC ✓ | 1ms | 3688kb | C++20 | 1.1kb | 2024-11-13 10:58:03 | 2024-11-13 10:58:04 |
Judging History
answer
#include <cstdio>
#include <vector>
#include <cstring>
#include <climits>
#include <iostream>
#include <algorithm>
using namespace std;
#define il inline
#define rr read()
#define wr puts()
#define bl putchar(' ')
#define in int
#define max(x, y) (x > y ? x : y)
#define min(x, y) (x < y ? x : y)
#define rep(i, l, n) for (in i = l; i >= n; i--)
#define int long long
il int read()
{
char ch;
bool f = 0;
while ((ch = getchar()) < '0' || ch > '9')
(ch == '-') && (f = 1);
in x = ch ^ '0';
while ((ch = getchar()) <= '9' && ch >= '0')
x = (x << 1) + (x << 3) + (ch ^ '0');
return f ? -x : x;
}
il void print(in x)
{
if (x < 0)
putchar('-'), x = -x;
if (x >= 10)
print(x / 10);
putchar(x % 10 ^ '0');
}
const int MAXN = 4e6 + 100;
void solve(){
int n, m;
cin >> n >> m ;
cout << (n * m) * 6 << "\n";
}
signed main()
{
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
std::cout.tie(nullptr);
int t;
t = 1;
while (t--)
{
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3548kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3640kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'