QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#750266#9628. 骰子libantian#WA 0ms3624kbC++23544b2024-11-15 13:45:392024-11-15 13:45:40

Judging History

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

  • [2024-11-15 13:45:40]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3624kb
  • [2024-11-15 13:45:39]
  • 提交

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: 0
Wrong Answer
time: 0ms
memory: 3624kb

input:

2 2

output:

201326592
201326592

result:

wrong answer 1st lines differ - expected: '24', found: '201326592'