题解 | #[ZJOI2010]COUNT 数字计数#

package main

import (
    "fmt"
)

func main() {
    var a,b int64
    fmt.Scan(&a, &b)
    bNum := digNum(b)
    aNum := digNum(a-1)
    for i:= 0; i < 10; i++ {
        fmt.Printf("%d", bNum[i]-aNum[i])
        if i == 9 {
            fmt.Println("")
        } else {
            fmt.Printf(" ")
        }
    }
}

func digNum(n int64) [10]int64 {
    origin := n
    var num [10]int64
    var power int64= 1
    for n > 0 {
         mod := n%10
        n/=10
        for i := int64(0); i < 10; i++ {
            if i == 0 && n > 0{
                if mod == i {
                    num[i] += (n-1)*power+origin%power +1
                } else if mod > i{
                    num[i] += n*power
                }
            }else if i > 0 {
                if mod < i {
                    num[i] += n*power
                } else if mod == i {
                    num[i] += n *power + origin%power +1
                } else if mod > i {
                    num[i] += (n+1)*power
                }
            }
        }
        //fmt.Println(num[0])
        power *=10
    }
    return num
}