/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Wrong Answer 2ms 548.0 KiB
#3 Wrong Answer 129ms 568.0 KiB
#4 Wrong Answer 92ms 560.0 KiB
#5 Wrong Answer 382ms 576.0 KiB
#6 Time Exceeded ≥1075ms ≥632.0 KiB
#7 Time Exceeded ≥1100ms ≥584.0 KiB
#8 Wrong Answer 161ms 1.629 MiB
#9 Time Exceeded ≥1083ms ≥1.434 MiB
#10 Time Exceeded ≥1090ms ≥324.0 KiB
#11 Time Exceeded ≥1096ms ≥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 + 1) / 2; 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:31:52
Judged At
2024-10-03 13:07:13
Judged By
Score
1
Total Time
≥1100ms
Peak Memory
≥1.629 MiB