328B.md (1323B)
1 Source: https://codeforces.com/problemset/problem/328/B 2 3 B. Sheldon and Ice Pieces 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 stdin 16 17 output 18 19 stdout 20 21 Do you remember how Kai constructed the word "eternity" using pieces of ice as components? 22 23 Little Sheldon plays with pieces of ice, each piece has exactly one digit between 0 and 9. He wants to construct his favourite number *t*. He realized that digits 6 and 9 are very similar, so he can rotate piece of ice with 6 to use as 9 (and vice versa). Similary, 2 and 5 work the same. There is no other pair of digits with similar effect. He called this effect "Digital Mimicry". 24 25 Sheldon favourite number is *t*. He wants to have as many instances of *t* as possible. How many instances he can construct using the given sequence of ice pieces. He can use any piece at most once. 26 27 Input 28 29 The first line contains integer *t* (1 ≤ *t* ≤ 10000). The second line contains the sequence of digits on the pieces. The length of line is equal to the number of pieces and between 1 and 200, inclusive. It contains digits between 0 and 9. 30 31 Output 32 33 Print the required number of instances. 34 35 Examples 36 37 Input 38 39 ``` 40 42 41 23454 42 ``` 43 44 Output 45 46 ``` 47 2 48 ``` 49 50 Input 51 52 ``` 53 169 54 12118999 55 ``` 56 57 Output 58 59 ``` 60 1 61 ``` 62 63 Note 64 65 This problem contains very weak pretests.