QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#690270 | #5149. Best Carry Player | ONISINO | WA | 0ms | 3680kb | C++20 | 1.5kb | 2024-10-30 21:21:34 | 2024-10-30 21:21:36 |
Judging History
answer
#include <bits/stdc++.h>
//DEBUG: https://github.com/sharkdp/dbg-macro
#ifdef LOCAL
#include "../Lib/dbg-macro-0.5.1/dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
#define endl '\n'
using namespace std;
typedef long long ll;
typedef long double llf;
const ll MAXN=2e5+10,MOD=998244353,INF=1e9;
ll qpow(ll base,ll exp){ll ans=1;while(exp){if(exp&1)(ans*=base)%=MOD;(base*=base)%=MOD;exp>>=1;}return ans;}
template<class T>ll max_binary_answer(ll l,ll r,T check,bool cmp=true){ll m;while(l<r){m=(l+r+1)/2;if(cmp^!check(m))l=m;else r=m-1;}return l;}
template<class T>ll min_binary_answer(ll l,ll r,T check,bool cmp=true){ll m;while(l<r){m=(l+r)/2;if(cmp^!check(m))r=m;else l=m+1;}return r;}
ll exgcd(ll a,ll b,ll &x,ll &y){ll tmp;return b==0?(x=1,y=0,a):(tmp=exgcd(b,a%b,y,x),y-=(a/b)*x,tmp);}
ll highbit(ll x){for(ll i=1;i<(ll)sizeof(ll)*4;i<<=1)x|=x>>i;return x-(x>>1);}
ll lowbit(ll x){return x&(-x);}
//--------Global declared area--------
//--------Global declared end --------
void solve(int test_num){
ll n,k;
cin>>n>>k;
if(k%2==0){
cout<<"YES"<<endl;
}else if(n<=3*k-2&&n!=2*k){
cout<<"YES"<<endl;
}else{
cout<<"NO"<<endl;
}
}
int main(){
#ifdef ACM
freopen("D:/Code/C or C++/File/input.txt","r",stdin);
freopen("D:/Code/C or C++/File/output.txt","w",stdout);
freopen("D:/Code/C or C++/File/error.txt","w",stderr);
#else
//std::ios::sync_with_stdio(false);
//std::cin.tie(nullptr),std::cout.tie(nullptr);
#endif
int t=1;
cin>>t;
for(int i=1;i<=t;i++){
solve(i);
//cout.flush();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3680kb
input:
2 3 9 99 999 1 12345
output:
YES YES
result:
wrong output format Expected integer, but "YES" found