/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 2ms 532.0 KiB
#3 Wrong Answer 2ms 320.0 KiB
#4 Wrong Answer 3ms 532.0 KiB
#5 Wrong Answer 3ms 536.0 KiB
#6 Wrong Answer 21ms 620.0 KiB
#7 Wrong Answer 193ms 1.332 MiB
#8 Wrong Answer 190ms 1.312 MiB
#9 Wrong Answer 188ms 1.383 MiB
#10 Wrong Answer 185ms 1.371 MiB
#11 Wrong Answer 186ms 1.453 MiB

Code

//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; while (t--)
const int N = 1e9 + 7;
using namespace std;
void s()
{
    int n,k;
    cin >> n >> k;
    cout << ((k-1)/n) * (k-(((k-1)/n)*n)) << endl;
}
int32_t main()
{   ios::sync_with_stdio(false);

    TC
    s();


}




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 16:59:26
Judged At
2024-10-03 13:05:35
Judged By
Score
1
Total Time
193ms
Peak Memory
1.453 MiB