/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 237ms 564.0 KiB
#4 Accepted 168ms 560.0 KiB
#5 Accepted 714ms 576.0 KiB
#6 Time Exceeded ≥1089ms ≥600.0 KiB
#7 Time Exceeded ≥1079ms ≥620.0 KiB
#8 Accepted 297ms 1.445 MiB
#9 Time Exceeded ≥1086ms ≥984.0 KiB
#10 Time Exceeded ≥1089ms ≥532.0 KiB
#11 Time Exceeded ≥1100ms ≥532.0 KiB

Code

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

#define ll long long
#define nl "\n"
#define ws " "
#define FASTIO ios_base::sync_with_stdio(false); cin.tie(NULL);
#define MOD 1000000007

typedef vector<int> vi;
typedef vector<pair<ll, ll>> vii;

int main () {
    FASTIO
    int t;
    cin>>t;
    while (t--) {
        ll n, k;
        cin>>n>>k;
        ll ans = 0, cnt = 1;
        for (ll i = n; i <= k; i += n) {
            ans = max (ans, (k - i) * cnt);
            cnt++;
        }
        cout<<ans<<nl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1092 Bitwise AND
Contest
Brain Booster #5
Language
C++17 (G++ 13.2.0)
Submit At
2024-09-05 16:55:34
Judged At
2024-10-03 13:05:46
Judged By
Score
50
Total Time
≥1100ms
Peak Memory
≥1.445 MiB