/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 524.0 KiB
#2 Accepted 2ms 320.0 KiB
#3 Accepted 2ms 536.0 KiB
#4 Accepted 2ms 320.0 KiB
#5 Accepted 3ms 348.0 KiB
#6 Accepted 21ms 704.0 KiB
#7 Accepted 196ms 1.91 MiB
#8 Accepted 208ms 1.641 MiB
#9 Accepted 207ms 1.863 MiB
#10 Accepted 204ms 2.273 MiB
#11 Accepted 195ms 1.957 MiB

Code

#include <iostream>
#include <cstdio>
#include<list>
#include<iomanip>
#include<cmath>
#include<queue>
#include <functional>
#include<stdio.h>
#include<assert.h>
#include<stack>
#include<sstream>
#include <cstdlib>
#include<map>
#include<algorithm>
#include<set>
#include<utility>
#include<memory.h>
#include<string>
#include<vector>
#include<numeric>
#include <bitset>
using namespace std;
#define ll  long long
#define pb push_back
#define fi(ss) freopen (ss,"r",stdin)
#define fo(ss) freopen (ss,"w",stdout)
#define sz(v)               ((ll)((v).size()))
#define all(x)          (x).begin(),(x).end()
#define rep(i, v)       for(ll i=0;i<sz(v);i++)
#define lp(i,n) for(ll i = 0 ; i < n ; ++i)
#define lpab(i, a, b) for(ll i = a; i <= b; i++)
#define lpba(i, b, a) for(ll i = b; i >= a; i--)
#define hash ___hash
#define next ___next
#define prev ___prev
#define left ___left
#define time __time
typedef pair<ll, ll> pii;
#define F first
#define S second
#define MP make_pair
#define vi vector<ll>
#define vvi vector<vi>
#define vpii vector<pii>
#define mpii map<ll, ll> 
#define mpsi map<string, ll>
#define vs vector<string>
#define ld long double
#define vd vector<ld>
#define pie acos(-1)
const ll maxn = 4 * 100005;
#define fastio ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define txtio   freopen("input.txt","r",stdin); freopen("output.txt","w",stdout);
#define OO 1e18

int main()
{
	fastio;
	ll t;
	cin >> t;
	while (t--)
	{
		ll n, k;
		cin >> n >> k;
		if (k <= n)
		{
			cout << 0 << endl;
			continue;
		}
		ll ans = 0;
		ll m = k % n;
		ll q = k / n;
		ll a = q % 2;
		q /= 2;
		if (a)
		{
			q++;
			k -= q * n;
		}
		else
		{
			k -= q * n;
		}
		ans = k * q;
		cout << ans << endl;
	}
	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 16:06:16
Judged At
2024-11-11 03:01:44
Judged By
Score
100
Total Time
208ms
Peak Memory
2.273 MiB