/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 1ms 320.0 KiB
#3 Wrong Answer 2ms 320.0 KiB
#4 Wrong Answer 1ms 324.0 KiB
#5 Wrong Answer 2ms 520.0 KiB
#6 Wrong Answer 4ms 600.0 KiB
#7 Wrong Answer 28ms 1.609 MiB
#8 Wrong Answer 27ms 1.32 MiB
#9 Wrong Answer 28ms 1.289 MiB
#10 Accepted 27ms 2.242 MiB
#11 Wrong Answer 27ms 2.086 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>;



int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //inout() ;
    ll t;
    cin>>t;
    while(t --){
    ll n,k;
    cin>>k>>n;
    ll x=n%(k+1);
    n-=x;
    n/=(k+1);
    x=x+(n);
    cout<<x*n<<'\n';
    
    
    }
    

    

    return 0 ;
}

Information

Submit By
Type
Submission
Problem
P1092 Bitwise AND
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-08 07:04:49
Judged At
2024-10-03 12:58:55
Judged By
Score
11
Total Time
28ms
Peak Memory
2.242 MiB