QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#750275#9628. 骰子libantian#AC ✓0ms3660kbC++23546b2024-11-15 13:47:442024-11-15 13:47:45

Judging History

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

  • [2024-11-15 13:47:45]
  • 评测
  • 测评结果:AC
  • 用时:0ms
  • 内存:3660kb
  • [2024-11-15 13:47:44]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define INF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define fi first
#define se second
#define all(_a) _a.begin(), _a.end()
const int INFF = 0x3f3f3f3f3f3f3f3f;


void solve() {
    int n,m;
    cin>>n>>m;
    cout<<n*m*6<<endl;
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cout << setiosflags(ios::fixed) << setprecision(15);
    int T;
    T=1;
    //cin>>T;
    while(T--)solve();
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2 2

output:

24

result:

ok single line: '24'

Test #2:

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

input:

1000 1000

output:

6000000

result:

ok single line: '6000000'

Test #3:

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

input:

987 654

output:

3872988

result:

ok single line: '3872988'