Problem:
Score : 300 points

Problem Statement

You are given an integer N. Among the integers between 1 and N (inclusive), how many Shichi-Go-San numbers (literally "Seven-Five-Three numbers") are there?

Here, a Shichi-Go-San number is a positive integer that satisfies the following condition:

When the number is written in base ten, each of the digits 7, 5 and 3 appears at least once, and the other digits never appear.

Constraints

1 \leq N < 10^9

N is an integer.

Input

Input is given from Standard Input in the following format:

N

Output

Print the number of the Shichi-Go-San numbers between 1 and N (inclusive).

Sample Input 1

575

Sample Output 1

4

There are four Shichi-Go-San numbers not greater than 575: 357, 375, 537 and 573.

Sample Input 2

3600

Sample Output 2

13

There are 13 Shichi-Go-San numbers not greater than 3600: the above four numbers, 735, 753, 3357, 3375, 3537, 3557, 3573, 3575 and 3577.

Sample Input 3

999999999

Sample Output 3

26484

Solution in Kotlin (1.3.71) (judge verdict: Wrong Answer)

import java.util.*
import kotlin.collections.ArrayDeque

fun main(args: Array<String>){

//    var (H, W) = readLine()!!.split(" ").map{it.toInt()}
    var N = readLine()!!.toLong()
    var ans = 0
    var queue = java.util.ArrayDeque<Long>()
    queue.add(3)
    queue.add(5)
    queue.add(7)

    while(!queue.isEmpty()){

        var i = queue.poll()



        if(i < N){
            if(i.toString().contains('3') && i.toString().contains('5') && i.toString().contains('7')) {
                ans++
            }
            Math.pow(10.toDouble(),i.toString().length.toDouble())
            queue.add(3* Math.pow(10.toDouble(),i.toString().length.toDouble()).toLong() + i)
            queue.add(5* Math.pow(10.toDouble(),i.toString().length.toDouble()).toLong() + i)
            queue.add(7* Math.pow(10.toDouble(),i.toString().length.toDouble()).toLong() + i)
        }

    }




    println(ans)

}