QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#238950#5141. Identical Paritytselmegkh#WA 62ms3512kbC++17530b2023-11-04 17:57:512023-11-04 17:57:51

Judging History

你现在查看的是最新测评结果

  • [2023-11-04 17:57:51]
  • 评测
  • 测评结果:WA
  • 用时:62ms
  • 内存:3512kb
  • [2023-11-04 17:57:51]
  • 提交

answer

#include <iostream>
using namespace std;


void solve(){
    int n, k;
    cin >> n >> k;
    if(n == k || k % 2 == 0){
        cout << "Yes\n";
        return;
    }
    if(n % 2 == 0){
        if(n / k > n % k){
            cout << "No\n";
            return;
        }
    }
    else{
        if(n / k - 1 > n % k){
            cout << "No\n";
            return;
        }
    }
    cout << "Yes\n";
    return;
}

int main(){
    int t; 
    cin >> t;
    while(t--){
        solve();
    }
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3512kb

input:

3
3 1
4 2
5 3

output:

No
Yes
Yes

result:

ok 3 token(s): yes count is 2, no count is 1

Test #2:

score: -100
Wrong Answer
time: 62ms
memory: 3392kb

input:

100000
1 1
2 1
2 2
3 1
3 2
3 3
4 1
4 2
4 3
4 4
5 1
5 2
5 3
5 4
5 5
6 1
6 2
6 3
6 4
6 5
6 6
7 1
7 2
7 3
7 4
7 5
7 6
7 7
8 1
8 2
8 3
8 4
8 5
8 6
8 7
8 8
9 1
9 2
9 3
9 4
9 5
9 6
9 7
9 8
9 9
10 1
10 2
10 3
10 4
10 5
10 6
10 7
10 8
10 9
10 10
11 1
11 2
11 3
11 4
11 5
11 6
11 7
11 8
11 9
11 10
11 11
12 1
...

output:

Yes
No
Yes
No
Yes
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Yes
No
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
Yes
No
Y...

result:

wrong answer expected NO, found YES [31st token]