/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 1ms 324.0 KiB
#3 Accepted 238ms 564.0 KiB
#4 Accepted 168ms 568.0 KiB
#5 Accepted 711ms 576.0 KiB
#6 Time Exceeded ≥1099ms ≥596.0 KiB
#7 Time Exceeded ≥1087ms ≥624.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-11-11 02:59:11
Judged By
Score
40
Total Time
≥1099ms
Peak Memory
≥624.0 KiB