QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#758637#9628. 骰子woodie_0064#AC ✓0ms3668kbC++20393b2024-11-17 19:10:542024-11-17 19:10:55

Judging History

你现在查看的是最新测评结果

  • [2024-11-17 19:10:55]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3668kb
  • [2024-11-17 19:10:54]
  • 提交

answer

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e5 + 3;
int T;
int n, num;
using i64 = long long;

void work(){
	i64 n, m, ans;
	cin >> n >> m;
	cout << n * m * 6 << "\n";
	
}


int main(){
//	freopen("test.txt", "r", stdin);
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	while(T--){
		work();
	}	
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3668kb

input:

2 2

output:

24

result:

ok single line: '24'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

1000 1000

output:

6000000

result:

ok single line: '6000000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3668kb

input:

987 654

output:

3872988

result:

ok single line: '3872988'