Haskell, 101 95 bytes

import Data.List
r a=or$map(a?)$(map read$tail.inits=<<tails(show a))\\[a]
a?b=b/=0&&a`mod`b==0

Try it online!

Changelog:

• Saved 4 bytes by replacing any id with or.
• Saved 2 bytes by η-expanding map read.(tail.inits=<<).tails.show$a to map read$tail.inits=<<tails(show a)

Explanation:

• tails returns all suffixes of a given list (note that a string is a list). inits returns all prefixes of a given list. By binding (aka =<<) the two together, we get all of the contiguous substrings. By also binding tail, which drops the first item from a list, we remove the empty string from this list (since inits always puts the empty string first in its output). This gives us \a->tail.inits=<<tails a
• We need to first convert our Int to a string, and convert our list of strings back to a list of ints at the end. We do this by adding show and map read: \a->map read$tail.inits=<<tails(show a)
• But we still need to get rid of the input number itself. Since we've already imported Data.List for inits and tails, we can use the list difference operator (\\), which saves us some bytes over the remove function: (map read$tail.inits=<<tails(show a))\\[a]
• Next we need to check if any of the numbers in the list are factors of the input. For this, we create the (?) operator, which checks if its second argument is a factor of its first. Firstly, 0 is not a factor of any number, so we check if the second argument is not zero. (Notice that the "not equal" operator in Haskell is (/=).) Then, we can use the mod function to get the modulo and check if that is zero. Iff b is not 0 and a `mod` b is 0, then a?b will return True: a?b=b/=0&&a`mod`b==0
• Then map a partial application of the (?) operator over our list of substring numbers: \a->map(a?)$(map read$tail.inits=<<tails(show a))\\[a]
• Finally, collapse the list into a single boolean output by using the or function, which takes a list of booleans and returns True only if any member of the list is True.

posted 5 months ago

CC BY-SA 4.0

5mo ago

Andrew Ray‭

61 reputation 1 2 6 1

JavaScript, 42 bytes

s=>(g=n=>--n&&s.includes(s%n?g:n)|g(n))(s)

Try it online!

posted 4 months ago

CC BY-SA 4.0

Shaggy‭

2151 reputation 4 117 218 166

Japt v1.4.5, 7 bytes

â¬d!øUs

Try it

â¬d!øUs     :Implicit input of integer U
⬠         :Divisors, excluding itself
  d         :Are any
   !ø       :  Contained in
     Us     :    The string representation of U

Or, if we could simply output truthy or falsey values:

6 bytes

⬣søX

Try it

⬣søX     :Implicit input of integer U
⬠        :Divisors, excluding itself
  £        :Map each X
   s       :  String representation of U
    øX     :  Contains X

posted 4 months ago

CC BY-SA 4.0

Shaggy‭

2151 reputation 4 117 218 166