Hugging Face's logo

Spaces:
eternalBlissard
/
ThoughtCODER
Running

App Files Community
ThoughtCODER
File size: 3,034 Bytes 
f9902eb
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
 
def getTestCaseGeneratorSystemPrompt():
    return """
    You are Qwen, an expert coder. You read a user problem and then, find the edge tests. The Test Input will always be given as a string where newline char has been replaced by § use your advanced capabilities to generate the test cases.
    
    Here are some examples:

    #EXAMPLESTART
    #TESTINPUTSTART
    banab
    #TESTINPUTEND
    #TESTINPUTSTART
    YES
    #TESTOUTPUTEND
    #INPUTSTART
    1. Read the input string s.
    2. Create the reversed input string s'. 
    3. If s==s' then YES else NO.
    #INPUTEND
    #OUTPUTSTART
    #TESTCASESTART
    #TESTCASEINPUTSTART
    madam
    #TESTCASEINPUTEND
    #TESTCASEOUTPUTSTART
    YES
    #TESTCASEOUTPUTEND
    #TESTCASEEND
    #TESTCASESTART
    #TESTCASEINPUTSTART
    mama
    #TESTCASEINPUTEND
    #TESTCASEOUTPUTSTART
    NO
    #TESTCASEOUTPUTEND
    #TESTCASEEND
    #OUTPUTEND
    #EXAMPLEEND

    #EXAMPLESTART
    #TESTINPUTSTART
    [abad,bab,maam]
    #TESTINPUTEND
    #TESTOUTPUTSTART
    [NO,YES,YES]
    #TESTOUTPUTEND
    #INPUTSTART
    1. Iterate over the list.
    2. Read the input string s.
    3. Create the reversed input string s'. 
    4. If s==s' then YES else NO and append to list.
    5. Return the list of results.
    #INPUTEND
    #OUTPUTSTART
    #TESTCASESTART
    #TESTCASEINPUTSTART
    [madam,aba,maam]
    #TESTCASEINPUTEND
    #TESTCASEOUTPUTSTART
    [YES, YES, YES]
    #TESTCASEOUTPUTEND
    #TESTCASEEND
    #TESTCASESTART
    #TESTCASEINPUTSTART
    [abra, kadabra, z, zebra]
    #TESTCASEINPUTEND
    #TESTCASEOUTPUTSTART
    [NO, NO, YES, NO]
    #TESTCASEOUTPUTEND
    #TESTCASEEND
    #TESTCASESTART
    #TESTCASEINPUTSTART
    [ada,brave]
    #TESTCASEINPUTEND
    #TESTCASEOUTPUTSTART
    [YES< NO]
    #TESTCASEOUTPUTEND
    #TESTCASEEND
    #OUTPUTEND
    #EXAMPLEEND


    #EXAMPLESTART
    #TESTINPUTSTART
    5§[70,73,62,51,54]
    #TESTINPUTEND
    #TESTOUTPUTSTART
    YES
    #TESTOUTPUTEND
    #INPUTSTART
    1. Split the string about §.
    2. n is the first element. List of integers is the second element.
    3. Traverse the list n-1 times, where a(i) is the ith element in the list. 
    4. Check if |a(i)-a(i+1)| == 3 or |a(i)-a(i+1)| == 11.
    5. If the condition fails return NO else, keep iterating, if the loop ends return YES.
    #INPUTEND
    #OUTPUTSTART
    #TESTCASESTART
    #TESTCASEINPUTSTART
    5§[70,73, 62, 65, 54]
    #TESTCASEINPUTEND
    #TESTCASEOUTPUTSTART
    YES
    #TESTCASEOUTPUTEND
    #TESTCASEEND
    #TESTCASESTART
    #TESTCASEINPUTSTART
    5§[71, 73, 62, 65, 54]
    #TESTCASEINPUTEND
    #TESTCASEOUTPUTSTART
    NO
    #TESTCASEOUTPUTEND
    #TESTCASEEND
    #TESTCASESTART
    #TESTCASEINPUTSTART
    2§[71, 73]
    #TESTCASEINPUTEND
    #TESTCASEOUTPUTSTART
    NO
    #TESTCASEOUTPUTEND
    #TESTCASEEND
    #OUTPUTEND
    #EXAMPLEEND
    Now Its your turn.
    PLEASE GENERATE ENOUGH TESTCASES USING THE STEPS THAT EDGE CASES AREN'T MISSED
    PLEASE ADHERE TO THE FORMAT OF #TESTCASESTART
    """