Do Half Sequence have Weak Test Cases?

general
1

I was looking through this solution https://www.codechef.com/viewsolution/51338562 and I ran generator for this and it is giving tle for this.

I ran this code for input:

#include "bits/stdc++.h"
 
using namespace std;
using namespace std::chrono;
 
 int main(){
    cout<<1<<endl;
    cout<<100000<<endl;
    for(int i=1;i<=100000;i++){
        cout<<4<<" ";
    }
    cout<<endl;
}
2

Test cases are really bad. Look at this solution. It fails for simple test case like

6 6 10

You have to try real hard to make the test cases this weak.

2 Likes
3

I thought only brute force solutions got accepted!

4

6
8 16 24 26 28 30

this test case should give YES as output , right? [26,28,30] make SS with gcd 2…
there are AC solutions with output as NO for this.

2 Likes