Untitled

mail@pastecode.io avatar
unknown
plain_text
16 days ago
546 B
0
Indexable
Never
#pragma GCC optimize("O2,no-stack-protector,unroll-loops")
#define ll long long
#define pb push_back
#define ipar(arr, n) vector<ll> arr(n); for(int i=0;i<n;i++) cin>>arr[i];
#include <cmath>
#include <bits/stdc++.h>
#define pii pair<int, int>;
#define pll pair<ll, ll>;
using namespace std;


void solve(){
    ll n,k; cin>>n>>k;
    if(k>n/2) {cout<<"no"<<"\n"; return;}
    ll sum=n*(n-1)/2;
    if(sum%2==0 && k%2==)
}


signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int t;
	cin>>t;
	while(t--) solve();
}
Leave a Comment