/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Wrong Answer 1ms 320.0 KiB
#2 Wrong Answer 4ms 572.0 KiB
#3 Wrong Answer 2ms 576.0 KiB
#4 Wrong Answer 1ms 532.0 KiB
#5 Wrong Answer 1ms 324.0 KiB
#6 Wrong Answer 1ms 324.0 KiB
#7 Wrong Answer 1ms 532.0 KiB
#8 Wrong Answer 1ms 324.0 KiB
#9 Wrong Answer 1ms 320.0 KiB
#10 Wrong Answer 1ms 324.0 KiB
#11 Wrong Answer 1ms 320.0 KiB
#12 Wrong Answer 1ms 508.0 KiB
#13 Wrong Answer 1ms 532.0 KiB
#14 Wrong Answer 1ms 388.0 KiB
#15 Wrong Answer 1ms 324.0 KiB
#16 Accepted 1ms 532.0 KiB
#17 Wrong Answer 1ms 316.0 KiB
#18 Wrong Answer 1ms 372.0 KiB
#19 Wrong Answer 1ms 324.0 KiB
#20 Wrong Answer 1ms 324.0 KiB

Code

/*For today, you happen to be the defeated. But what will you become tomorrow?*/

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

#define int long long int 
#define dbg if(debugg)
#define F first 
#define S second 

bool debugg = false;

template <typename T>
using order_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;

template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());  

void solve()
{
    int a, b;
    cin >> a >> b;
    cout << a * b - min(a, b) << '\n';
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
        
    int t = 1;
    cin >> t;
    
    while(t--){
        solve();
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1087 Face the monsters
Contest
Brain Booster #5
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-05 16:45:32
Judged At
2024-10-03 13:06:18
Judged By
Score
5
Total Time
4ms
Peak Memory
576.0 KiB