Skip to content

Latest commit

 

History

History
253 lines (221 loc) · 3.62 KB

hidden_test_cases.md

File metadata and controls

253 lines (221 loc) · 3.62 KB

Okstate ACM Programming Contest Fall 2017 Hidden Test Cases

Problem 1

  • Input: Go Pokes
    Output:

    s
 e
  k
   o
    p
     
      o
       G

  • Input: Example string
    Output:

    g
 n
  i
   r
    t
     s
      
       e
        l
         p
          m
           a
            x
             E

Problem 2

  • Input1: hello
    Input2: byffi
    Output: 20

  • Input1: contest
    Input2: qcbhsgh
    Output: 14

  • Input1: caesar
    Input2: caesar
    Output: 0 or 26

Problem 3

  • Input: 5 hello the sun is cool
    Output:

    olleh hello
  eht the
  nus sun
   si is
 looc cool

  • Input: 3 bananas chocolate alkatraz
    Output:

      sananab bananas
etalocohc chocolate
 zartakla alkatraz

Problem 4

  • This will be a bit hard, since you will need to edit files. Just make sure you type everything down correctly.

  • Input File:

    0 4 5 6
1 2 3 4
4 3 2 1
7 5 4 0

    Output: Yes, this is palindromic

  • Input File:

    0 5 5 9
1 8 7 3
0 9 8 2
5 4 3 1

    Output: No, this is not palindromic

Problem 5

  • Input: 
    2 3
1 1
1 2 3
  • Output: (1, 2), (1, 3)
  • Input:
10 20
1 2 3 4 5 6 7 8 9 10 3
1 2 3 4 5 6 7 8 9 10 1 1 1 1 1 1 1 1 1 1
  • Output:
Not enough boots!
  • Input:
20 21
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
21 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20
  • Output:
(1,2), (2,3), (3,4), (4,5), (5,6), (6,7), (7,8), (8,9), (9,10),
(10,11), (11,12), (12,13), (13,14), (14,15), (15,16), (16,17),
(17,18), (18,19), (19,20), (20,21)

Problem 6

  • Input: 196418
  • Output: 16
- Input: 46 - Output: 46 is not in the fibonacci sequence before 45
- Input: 24157817 - Output: 77

Problem 7

  • Test with n = 300 as well as two other random values of n from the attached file

Problem 8

  • Input:
6
..R...
.XXXX.
.XHXX.
....X.
......
......
  • Output:
DLLUUURR
  • Input:
9
H........
.........
.........
.........
.........
.........
.........
.........
........R
  • Output (not unique):
DDDDDDDDRRRRRRRR

Problem 9

  • Input (this is a corner case):
H = 1, W = 1
5
  • Output:
Cost = 5
_blank_
  • Input:
H = 2, W = 1
7
2
  • Output:
Cost = 9
U
  • Input:
H = 3, W = 4
2 4 6 9
3 1 2 4
8 5 3 1
  • Output:
Cost = 27
U, R, R, R, U

Problem 10

  • Again, this one will be time consuming to judge. Thankfully it's designed so you probably won't have to do it often. Just make sure you type everything down correctly.

  • NOTE: Do not include the spaces I put between each charater, that is just used to better tell how many underscores there are

  • Input File:

R " a p p l e s " D
Q _ _ P P P P P P L

Output:

selppa
  • Input File (There is just one space between the "", sorry it's kind of confusing):
R D _ P "   " L _ _
_ R _ _ _ _ _ _ D _
D " h e l l o " L _
R P P P P P 0 7 J Q

Output:

hello hello