QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#752885#9628. 骰子D12EQD#RE 0ms0kbC++17848b2024-11-16 10:16:392024-11-16 10:16:42

Judging History

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

  • [2024-11-16 10:16:42]
  • 评测
  • 测评结果:RE
  • 用时:0ms
  • 内存:0kb
  • [2024-11-16 10:16:39]
  • 提交

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");
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Dangerous Syscalls

input:

2 2

output:


result: