3 deleted 239 characters in body
source | link

QBIC, 3636 23 bytes

[_l;|-1|q=q*(_sA,a,1|=_sA,a+1,1|)}[_l!:$||p=p*z+1]?qb%p=0

String-based solution that returns 1 or -1 on repdigit numbers, 0 otherwise.

Explanation

[      |   :     Read a FORnumber afrom =the 1cmd toline
 _l |-1 ! $    cast it to string
 _l   the| length of ...Take minusits 1length
[   ;|   |  And run a FOR-loop from 1 to that length 
p= the cmd line argument (as string)
 q=q* p starts out as 0. set it to  
  p*z  q (which starts as 1) getsitself multiplied by
  ( ..10 =(z=10 ..in QBIC)        either -1 or(still 0 depending on equalitythe between
first _sA,a,1|run
  +1        then add 1. On aconsecutive substringFOR-loops ofyields A$1, at pos a11, for 1 char
 _sA,a+1111,1|            and the char at a+1....
 }    ]         Close the FOR NEXTloop
 ?q            b%p=0   If we've seenPRINT unequal-1 chars,if we;veb multipliedmod qp byis 0.
                  Printing(ie it444 here% shoud111 show= 0 then), or either a 1 or -1
                  (depending on input length) for0 repdigits.otherwise

QBIC, 36 bytes

[_l;|-1|q=q*(_sA,a,1|=_sA,a+1,1|)}?q

String-based solution that returns 1 or -1 on repdigit numbers, 0 otherwise.

Explanation

[      |          FOR a = 1 to
 _l |-1             the length of ... minus 1
   ;|               the cmd line argument (as string)
 q=q*             q (which starts as 1) gets multiplied by
  ( .. = .. )        either -1 or 0 depending on equality between
 _sA,a,1|              a substring of A$, at pos a, for 1 char
 _sA,a+1,1|            and the char at a+1
 }                NEXT
 ?q               If we've seen unequal chars, we;ve multiplied q by 0.
                  Printing it here shoud show 0 then, or either a 1 or -1
                  (depending on input length) for repdigits.

QBIC, 36 23 bytes

[_l!:$||p=p*z+1]?b%p=0

Explanation

    :     Read a number from the cmd line
   ! $    cast it to string
 _l   |   Take its length
[      |  And run a FOR-loop from 1 to that length 
p=        p starts out as 0. set it to  
  p*z       itself multiplied by 10 (z=10 in QBIC) (still 0 on the first run
  +1        then add 1. On consecutive FOR-loops yields 1, 11, 111, ....
]         Close the FOR loop
?b%p=0    PRINT -1 if b mod p is 0 (ie 444 % 111 = 0), or 0 otherwise
2 added 653 characters in body
source | link

QBIC, 36 bytes

[_l;|-1|q=q*(_sA,a,1|=_sA,a+1,1|)}?q

String-based solution that returns 1 or -1 on repdigit numbers, 0 otherwise.

Explanation

[      |          FOR a = 1 to
 _l |-1             the length of ... minus 1
   ;|               the cmd line argument (as string)
 q=q*             q (which starts as 1) gets multiplied by
 ( .. = .. )        either -1 or 0 depending on equality between
 _sA,a,1|              a substring of A$, at pos a, for 1 char
 _sA,a+1,1|            and the char at a+1
 }                NEXT
 ?q               If we've seen unequal chars, we;ve multiplied q by 0.
                  Printing it here shoud show 0 then, or either a 1 or -1
                  (depending on input length) for repdigits.

QBIC, 36 bytes

[_l;|-1|q=q*(_sA,a,1|=_sA,a+1,1|)}?q

String-based solution that returns 1 or -1 on repdigit numbers, 0 otherwise.

QBIC, 36 bytes

[_l;|-1|q=q*(_sA,a,1|=_sA,a+1,1|)}?q

String-based solution that returns 1 or -1 on repdigit numbers, 0 otherwise.

Explanation

[      |          FOR a = 1 to
 _l |-1             the length of ... minus 1
   ;|               the cmd line argument (as string)
 q=q*             q (which starts as 1) gets multiplied by
 ( .. = .. )        either -1 or 0 depending on equality between
 _sA,a,1|              a substring of A$, at pos a, for 1 char
 _sA,a+1,1|            and the char at a+1
 }                NEXT
 ?q               If we've seen unequal chars, we;ve multiplied q by 0.
                  Printing it here shoud show 0 then, or either a 1 or -1
                  (depending on input length) for repdigits.
1
source | link

QBIC, 36 bytes

[_l;|-1|q=q*(_sA,a,1|=_sA,a+1,1|)}?q

String-based solution that returns 1 or -1 on repdigit numbers, 0 otherwise.