Problem description

.desc_header { margin-bottom: 2em; text-align: center; } .desc_title { font-size: 200%; text-decoration: underline; padding: 0em 0.2em; display: inline-block; } .desc_code { padding: 0em 0.2em; font-weight: bold; display: inline-block; } .desc_meta { margin: 0.5em; } .desc_memlimit { padding: 0em 1.25em; display: inline-block; } .desc_timelimit { padding: 0em 1.25em; display: inline-block; } .desc .example-test { width: 100%; margin-top: 10px; } .desc .example-test td { vertical-align: top; } .desc .example-test pre { margin-top: 5px; } Guessing game (zgadywanka-1) Memory limit: 32 MB Time limit: 0.50 s This is an interactive problem. The grader chose some positive integer K from range 1 to N (inclusive). The goal of your program is to guess the value of K asking at most 30 queries (the details are given below). Interaction Initially, the grader gives (to the standard input of your program) the integer N. Then, your program may ask queries about any integer K′ from range 1 to N. The query should be printed to the standard output. The grader answers <, > or = to the standard input of your program (depending on case if K < K′, K > K′ or K = K′). Please remember about flushing the standard output buffer every query. Limits 1 ≤ N ≤ 109. Example interaction Input Output 10 5 > 8 < 7 = In the example test N = 10 and K = 7.