Bir merdiven sayısı, pozitif bir tamsayıdır x onun bu tür N inci haneli (en az önemli basamak başlayarak endeksli bir) eşittir için % x (n + 1) . Bu biraz ağız doludur bu yüzden bir örneğe bakalım. Al 7211311 biz modüler artıkları alırsak, 7211311 aşağıdaki olsun aralığında 2-8 tarih:

7211311 % 2 = 1
7211311 % 3 = 1
7211311 % 4 = 3
7211311 % 5 = 1
7211311 % 6 = 1
7211311 % 7 = 2
7211311 % 8 = 7

Bunlar 7211311'in rakamları ! Böylece 7211311 bir merdiven numarasıdır.

Görev

Girdi olarak pozitif bir sayı verildiğinde alan kod, bir sayı bir sayı ise diğeri değilse iki ayrı değer verir .

Bu bir kod golf yarışmasıdır, bu nedenle amacınız kaynak kodunuzdaki bayt sayısını en aza indirgemek olmalıdır.

Test Kılıfları

İşte ilk 13 merdiven numarası:

1, 10, 20, 1101, 1121, 11311, 31101, 40210, 340210, 4620020, 5431101, 7211311, 12040210

Haskell, 55 57 bayt

f m|let n#x=n==0||n`mod`10==m`mod`x&&div n 10#(x+1)=m#2

Diğer Haskell çözümünden farklı bir yaklaşım.

2 bayt kaydettiğiniz için teşekkür ederiz.

Brachylog , 25 21 16 14 bayt

{it+₂;?↔%}ᶠ↔c?

Çevrimiçi deneyin!

İlk Brachylog sunumu: D muhtemelen çok yıpranmış ... Leaky Nun ve Fatalize için teşekkürler, cesaretlendirmek ve 25'ten başlayarak sadece 14'e kadar golf oynamak için yardım ediyor. :) :)

Javascript, 42 41 39 38 bayt

@Shaggy ve @ETHProductions sayesinde -4 bayt

s=>[...s].some(d=>s%i++^d,i=~s.length)

Bu, sayıyı bir dize olarak alır ve sayı falsebir merdiven numarasıysa geri döner true.

Örnek kod pasajı:

f=
s=>[...s].some(d=>s%i++^d,i=~s.length)

function update() {
  o.innerText = f(document.getElementById("i").value)
}

<input id="i" type="number">
<button onclick="update()">Test</button>
<p id="o">

05AB1E , 6 bayt

Kod:

ā>%JRQ

05AB1E kodlamasını kullanır . Çevrimiçi deneyin!

Açıklama:

ā        # Get the range [1 .. len(input)]
 >       # Increment by 1
  %      # Vectorized modulo
   J     # Join the array into a single number
    RQ   # Reverse that number and check if it's equal to the original input

Haskell, 60 bayt

Sayıyı int olarak alır.

x n|s<-show n=reverse s==(rem n.(+1)<$>[1..length s]>>=show)

Mathematica, 60 bytes

FromDigits@Reverse@Mod[#,Range@Length@IntegerDigits@#+1]==#&

Try it online!

@alephalpha golfed it to 48

Mathematica, 48 bytes

FromDigits@Reverse@Mod[#,Range[2,Log10@#+2]]==#&

next one is 24120020

Python 2, 54 bytes

f=lambda n,x=0:10**x>n or(`n%(x+2)`==`n`[~x])*f(n,x+1)

Try it online!

Japt, 9 7 bytes

Takes input as a string.

¥£%´JÃw

Test it

• 2 bytes saved with help from ETHproductions.

Explanation

We implicitly take the string as input.

£   Ã

Map over each character in the string.

´J

J is the Japt constant for -1, and ´ decrements it by 1 on each pass (-- in JavaScript). So, on the first pass, this gives us -2.

%

We use that value to perform a modulo operation on the input string which is automatically cast to an integer in the process. In JavaScript x%-y gives the same result as x%y.

w

Reverse the resulting string.

¥

Check if the new string is equal to the original input and implicily output the result as a boolean.

Neim, 6 bytes

𝐧ᛖ𝕄𝐫𝐣𝔼

Explanation:

𝐧         Get the length of the input, then create an exclusive range
 ᛖ        Add 2 to each element
  𝕄       Modulus
    𝐫      Reverse
     𝐣     Join
      𝔼   Check for equality

Try it online!

Jelly, 7 bytes

DJ‘⁸%⁼Ṛ

Try it online!

Python 2, 56 bytes

lambda x:all(`x%(i+2)`==`x`[~i]for i in range(len(`x`)))

Try it online!

Perl 6, 32 bytes

{$_ eq[~] $_ «%«(1+.comb...2)}

Try it online!

• .comb is the number of characters in the string representation of the input argument $_ (that is, the number of digits).
• 1 + .comb ... 2 is the sequence of numbers from one greater than the number of digits down to 2.
• «%« is the modulus hyperoperator that gives the remainder when $_, the input argument on its left, is divided by each of the elements of the sequence on its right: $_ % 2, $_ % 3, ....
• [~] concatenates those digits into a new number, which is compared with the input argument using the string equality operator eq.

PHP, 43 bytes

for(;$r<$a=$argn;)$r=$a%~++$i.$r;echo$r>$a;

Try it online!

PHP, 44 bytes

prints 1 for true and nothing for false

for(;$r<$a=$argn;)$r=$a%~++$i.$r;echo$r==$a;

Try it online!

Pyth, 13 bytes

-1 bytes thanks to Okx.

qsjk_m%QhdSl`

Try it online!

Explanation

             QQ    # Implicit input
          Sl`Q     # Generate [1, len(str(Q))]
     m%Qhd         # For digit d in above range, perform Q % (d + 1)
 sjk_              # Reverse, then convert to number
q             Q    # Test equality with input

Alternate solution, still 13 bytes (thanks to karlkastor)

qi_.e%Q+2k`QT

Try it online! That's essentially the same as the first solution, excepted that it uses i to convert from array of numbers to a number, and that the range is generated differently.

C++,104 bytes

1) original version:

int main(){int N,T,R=1;cin>>N;T=N;for(int i=1;i<=log10(N)+1;i++){if(N%(i+1)!=T%10){R=0;}T/=10;}cout<<R;}

2) in a readable form:

int main()
{
    int N, T, R = 1;

    cin >> N;
    T = N;

    for (int i = 1; i <= log10(N) + 1; i++)
    {
        if (N % (i + 1) != T % 10)
        {
            R = 0;
        }

        T /= 10;
    }

    cout << R;
}

Try it Online!

Pari/GP, 42 bytes

n->Vecrev(s=digits(n))==[n%d|d<-[2..#s+1]]

Try it online!

Python 2, 66 60 58 57 bytes

• Thanks to @Leaky nun for 6 bytes: remove unneeded x and (shouldnot check for 0)
• Thanks to @Einkorn Enchanter for 1 byte: use of enumerate

lambda x:all(a==`x%(i+2)`for i,a in enumerate(`x`[::-1]))

Try it online!

Python 3: 63 Bytes

lambda m:all(int(x)==m%(n+2)for n,x in enumerate(str(m)[::-1]))

If I could count the number of times I wished 'enumerate' were shorter...

Try it online!

Java (OpenJDK 8), 60 bytes

n->{int m=2,r=0,t=1;for(;n>=t;t*=10)r+=n%m++*t;return r==n;}

Try it online!

A non-string version.

Java 8, 156 149 bytes

interface B{static void main(String[]s){String f="";for(int i=1;i<=s[0].length();)f=new Long(s[0])%++i+f;System.out.print(f.equals(s[0]));}}

Ungolfed :

interface B {
    static void main(String[] s) {
        String f = "";
        for (int i = 1; i <= s[0].length();)
            f = new Long(s[0]) % ++i + f;
        System.out.print(f.equals(s[0]));
    }
}

Try it Online !

UPDATE :
-7 bytes : removed useless {} and replaced Integer.parseInt(...) by new Integer(...)
-9 bytes : thanks to Kevin Cruijssen, removed a bunch of useless (), used Long instead of Integer and print instead of println. Thanks Kévin !

Charcoal, 20 15 bytes

⌊Ｅθ⁼ιＩ﹪Ｉθ⁻⁺¹Ｌθκ

Try it online! Outputs - for a staircase number, nothing otherwise. Link is to verbose version of code.

Python 2, 61 bytes

lambda x:[`x%(n+2)`for n in range(len(`x`))][::-1]==list(`x`)

q/kdb+, 34 bytes

Solution:

{s~raze($)x mod'2+(|)(!)(#)s:($)x}

Example:

q){s~raze($)x mod'2+(|)(!)(#)s:($)x}7211311 / this is a staircase number (true)
1b
q){s~raze($)x mod'2+(|)(!)(#)s:($)x}7211312 / this is not (false)
0b
q)t(&){s~raze($)x mod'2+(|)(!)(#)s:($)x}each t:1 + til 1000000 / up to a million
1 10 20 1101 1121 11311 31101 40210 340210

Explanation:

Cast the input number to a string, count from 0..length of string, add 2 to all, reverse it and feed each number into mod along with the original input. Cast the result of the mod to a string and reduce the list, check if it is equal to the string of the input number:

{s~raze string x mod'2 + reverse til count s:string x} / ungolfed solution
{                                                    } / lambda function
                                           s:string x  / convert input to string, save as s
                                     count             / return length of this string
                                 til                   / like python's range() function
                         reverse                       / reverses the list
                     2 +                               / adds two to each element in the list
               x mod'                                  / ' is each both, so feeds x, and each element of the list to modulo function
        string                                         / converts output list to string list ("7";"2";"1"..etc)
   raze                                                / reduce list ("721...")
 s~                                                    / is s equal to this reduced list, returns boolean

Notes:

Most of the solution is for generating the 2,3,4.. list, I have another solution that does less stuff, but winds up being 37 bytes after golfing:

{s~x mod'reverse 2 + til count s:("J"$) each string x} / ungolfed
{s~x mod'(|)2+til(#)s:("J"$)each($)x}                  / golfed

Clojure, 75 bytes

#(=(sort %)(sort(map(fn[i c](char(+(mod(Integer. %)(+ i 2))48)))(range)%)))

Input is a string, using map and the trailing % ended up being shorter than for[i(range(count %))] approach.

Haskell, 62 bytes

f x=and$zipWith(==)(reverse$show x)$map(head.show.mod x)[2..]

Instead of reversing the (infinite) list of moduli, it truncates the list by zipping it with the reversed string-respresentation of the integral x, which it then ensures is equal element-wise.

Perl 5, 41 bytes

39 bytes of code + 2 flags -pa

map{$\||=$_!=$F[0]%++$n}0,reverse/./g}{

Try it online!

Outputs nothing (undef) for staircase numbers, 1 for anything else