結果
問題 | No.741 AscNumber(Easy) |
ユーザー |
![]() |
提出日時 | 2020-08-22 10:03:09 |
言語 | Go (1.23.4) |
結果 |
AC
|
実行時間 | 332 ms / 2,000 ms |
コード長 | 2,505 bytes |
コンパイル時間 | 12,061 ms |
コンパイル使用メモリ | 241,256 KB |
実行使用メモリ | 103,552 KB |
最終ジャッジ日時 | 2024-10-15 06:50:19 |
合計ジャッジ時間 | 18,033 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 55 |
ソースコード
package mainimport ("bufio""fmt""os""strconv")func configure(scanner *bufio.Scanner) {scanner.Split(bufio.ScanWords)scanner.Buffer(make([]byte, 1000005), 1000005)}func getNextString(scanner *bufio.Scanner) string {scanned := scanner.Scan()if !scanned {panic("scan failed")}return scanner.Text()}func getNextInt(scanner *bufio.Scanner) int {i, _ := strconv.Atoi(getNextString(scanner))return i}func getNextInt64(scanner *bufio.Scanner) int64 {i, _ := strconv.ParseInt(getNextString(scanner), 10, 64)return i}func getNextFloat64(scanner *bufio.Scanner) float64 {i, _ := strconv.ParseFloat(getNextString(scanner), 64)return i}func main() {fp := os.Stdinwfp := os.Stdoutextra := 0if os.Getenv("I") == "IronMan" {fp, _ = os.Open(os.Getenv("END_GAME"))extra = 100}scanner := bufio.NewScanner(fp)configure(scanner)writer := bufio.NewWriter(wfp)defer func() {r := recover()if r != nil {fmt.Fprintln(writer, r)}writer.Flush()}()solve(scanner, writer)for i := 0; i < extra; i++ {fmt.Fprintln(writer, "-----------------------------------")solve(scanner, writer)}}func solve(scanner *bufio.Scanner, writer *bufio.Writer) {n := getNextInt(scanner)dp := makeGrid(n+1, 10)dp[0][0] = 1for i := 0; i < n; i++ {for j := 0; j < 10; j++ {for k := j; k < 10; k++ {dp[i+1][k].addAs(dp[i][j])}}}var ans mintfor i := 0; i < 10; i++ {ans.addAs(dp[n][i])}fmt.Fprintln(writer, ans)}func makeGrid(h, w int) [][]mint {index := make([][]mint, h, h)data := make([]mint, h*w, h*w)for i := 0; i < h; i++ {index[i] = data[i*w : (i+1)*w]}return index}type mint int64func (mt mint) mod() mint {m := mint(1e9 + 7)mt %= mif mt < 0 {return mt + m}return mt}func (mt mint) inv() mint {return mt.pow(mint(0).sub(2))}func (mt mint) pow(n mint) mint {p := mint(1)for n > 0 {if n&1 == 1 {p.mulAs(mt)}mt.mulAs(mt)n >>= 1}return p}func (mt mint) add(x mint) mint {return (mt + x).mod()}func (mt mint) sub(x mint) mint {return (mt - x).mod()}func (mt mint) mul(x mint) mint {return (mt * x).mod()}func (mt mint) div(x mint) mint {return mt.mul(x.inv())}func (mt *mint) addAs(x mint) *mint {*mt = mt.add(x)return mt}func (mt *mint) subAs(x mint) *mint {*mt = mt.sub(x)return mt}func (mt *mint) mulAs(x mint) *mint {*mt = mt.mul(x)return mt}func (mt *mint) divAs(x mint) *mint {*mt = mt.div(x)return mt}