/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 1ms 324.0 KiB
#3 Wrong Answer 1ms 324.0 KiB
#4 Wrong Answer 1ms 328.0 KiB
#5 Wrong Answer 1ms 532.0 KiB
#6 Wrong Answer 4ms 532.0 KiB
#7 Wrong Answer 25ms 1.527 MiB
#8 Wrong Answer 24ms 1.062 MiB
#9 Wrong Answer 25ms 1.316 MiB
#10 Accepted 24ms 2.215 MiB
#11 Wrong Answer 25ms 2.066 MiB

Code

#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;

typedef long long int ll ;
//typedef __int128 lll;
#define pb push_back
#define pinf   2e18
#define ninf   -2e18
#define PI    acos(-1.0)
#define endl  "\n"
#define F first
#define S second

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

ll gcd (ll a,ll b) {
    if(a%b==0)return b;
    return gcd(b,a%b);
}


int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //inout() ;

    ll t,i,j ;
    cin>>t ;
    while(t--) {
        ll n,k;
        cin>>n>>k;
         n++;
         cout<<((k/n)*((k/n)+(k%n==1)))<<'\n';
         
        
        









    }
    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:28:12
Judged At
2024-10-03 13:03:46
Judged By
Score
11
Total Time
25ms
Peak Memory
2.215 MiB