-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path566-mathematical-circus.cpp
More file actions
59 lines (58 loc) · 1.29 KB
/
Copy path566-mathematical-circus.cpp
File metadata and controls
59 lines (58 loc) · 1.29 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
/*
* Mathematical Circus [1719B]
* Problem: https://codeforces.com/problemset/problem/1719/B
* Verdict: ACCEPTED Solved: 2022-08-16
* Language: C++20 (GCC 11-64)
* Runtime: 46 ms Memory: 2100 KB
* Tags: constructive algorithms, math
* Author: BidoTeima
* Source: https://codeforces.com/contest/1719/submission/168545522
*/
/// isA AC
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void ACPLS()
{
#ifndef ONLINE_JUDGE
freopen("output.txt", "w", stdout);
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void moo(string fileName){
freopen((fileName+".in").c_str(),"r",stdin);
freopen((fileName+".out").c_str(),"w",stdout);
}
#define tc \
int tttttt,subtask; \
cin >> tttttt /*>> subtask*/; \
while (tttttt--)
#define sumrange(l, r, arr) (l == 0 ? arr[r] : arr[r] - arr[l - 1])
#define all(v) v.begin(), v.end()
int main()
{
ACPLS();
tc{
ll n,k;
cin>>n>>k;
bool ok = 1;
vector<pair<int,int>>v;
for(ll i = 1; i+1 <= n; i+=2){
if((i+k)*(i+1) % 4 == 0)
v.push_back({i,i+1});
else if((i+1+k)*i % 4 == 0){
v.push_back({i+1,i});
}
else ok = 0;
}
if(ok){
cout<<"YES\n";
for(auto i:v)
cout<<i.first<<' '<<i.second<<'\n';
}
else cout<<"NO\n";
}
}