QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #793596 | #9628. 骰子 | Humbler | AC ✓ | 0ms | 3696kb | C++14 | 286b | 2024-11-29 21:28:09 | 2024-11-29 21:28:09 |
Judging History
answer
#include <iostream>
#include <cstring>
#include<queue>
#include <algorithm>
using namespace std;
#define MAXSIZE 1005
#define inf 0x3f3f3f3f
int dp[MAXSIZE][MAXSIZE];
int cost[MAXSIZE],w[MAXSIZE];
int main() {
int n,m;
cin>>n>>m;
cout<<6*n*m;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3568kb
input:
2 2
output:
24
result:
ok single line: '24'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3504kb
input:
1000 1000
output:
6000000
result:
ok single line: '6000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3696kb
input:
987 654
output:
3872988
result:
ok single line: '3872988'