codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1692D.md (1858B)


      1 Source: https://codeforces.com/problemset/problem/1692/D
      2 
      3 D. The Clock
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Victor has a [24-hour clock](https://en.wikipedia.org/wiki/24-hour_clock) that shows the time in the format "HH:MM" (00 $\le$ HH $\le$ 23, 00 $\le$ MM $\le$ 59). He looks at the clock every $x$ minutes, and the clock is currently showing time $s$.
     22 
     23 How many different palindromes will Victor see in total after looking at the clock every $x$ minutes, the first time being at time $s$?
     24 
     25 For example, if the clock starts out as 03:12 and Victor looks at the clock every $360$ minutes (i.e. every $6$ hours), then he will see the times 03:12, 09:12, 15:12, 21:12, 03:12, and the times will continue to repeat. Here the time 21:12 is the only palindrome he will ever see, so the answer is $1$.
     26 
     27 A palindrome is a string that reads the same backward as forward. For example, the times 12:21, 05:50, 11:11 are palindromes but 13:13, 22:10, 02:22 are not.
     28 
     29 Input
     30 
     31 The first line of the input contains an integer $t$ ($1 \leq t \leq 100$) — the number of test cases. The description of each test case follows.
     32 
     33 The only line of each test case contains a string $s$ of length $5$ with the format "HH:MM" where "HH" is from "00" to "23" and "MM" is from "00" to "59" (both "HH" and "MM" have exactly two digits) and an integer $x$ ($1 \leq x \leq 1440$) — the number of minutes Victor takes to look again at the clock.
     34 
     35 Output
     36 
     37 For each test case, output a single integer — the number of different palindromes Victor will see if he looks at the clock every $x$ minutes starting from time $s$.
     38 
     39 Example
     40 
     41 Input
     42 
     43 ```
     44 6
     45 
     46 03:12 360
     47 
     48 00:00 1
     49 
     50 13:22 2
     51 
     52 15:15 10
     53 
     54 11:11 1440
     55 
     56 22:30 27
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 1
     63 16
     64 10
     65 0
     66 1
     67 1
     68 ```
     69 
     70 Note
     71 
     72 The first test case is explained in the statement.