/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 536.0 KiB
#2 Wrong Answer 2ms 536.0 KiB
#3 Wrong Answer 2ms 324.0 KiB
#4 Wrong Answer 2ms 320.0 KiB
#5 Wrong Answer 3ms 568.0 KiB
#6 Wrong Answer 21ms 568.0 KiB
#7 Wrong Answer 193ms 1.391 MiB
#8 Wrong Answer 197ms 1.312 MiB
#9 Wrong Answer 198ms 1.516 MiB
#10 Wrong Answer 197ms 1.559 MiB
#11 Wrong Answer 199ms 1.562 MiB

Code

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define pb push_back
#define vi vector<int>
#define vll vector<ll>
#define mp make_pair
#define pq priority_queue<int>
#define pi pair<int, int>
#define pll pair<ll, ll>
#define all(x) (x).begin(), (x).end()
#define f(i, n) for (int i = 0; i < n; i++)
#define PI acos(-1)
const int M = 1e9 + 7;
ll binExp(ll a, ll b)
{
    int res = 1;
    while (b)
    {
        if (b & 1)
            res = res * a;
        a *= a;
        b /= 2;
    }
    return res;
}
ll gcd(ll a, ll b)
{
    if (a == 0)
        return b;
    return gcd(b % a, a);
}
ll lcm(ll a, ll b)
{
    return (a / gcd(a, b)) * b;
}
ll n, k;
bool fun(ll d)
{
    return (k - d * n) >= n;
}
void solve()
{
    cin >> n >> k;
    if (n > k)
    {
        cout << "0\n";
        return;
    }
    ll ans = (k / n) * (k % n);
    ll d = k / n - 1;
    ans = max(ans, d * (k - (d * n)));
    d--;
    ans = max(ans, d * (k - (d * n)));
    cout << ans << endl;
}
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while (t--)
    {
        solve();
    }

    return 0;
}

Information

Submit By
Type
Submission
Problem
P1092 Bitwise AND
Contest
Brain Booster #5
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-05 17:17:32
Judged At
2024-10-03 13:04:47
Judged By
Score
1
Total Time
199ms
Peak Memory
1.562 MiB