結果

問題 No.446 ゆきこーだーの雨と雪 (1)
ユーザー ccppjsrbccppjsrb
提出日時 2020-06-26 21:12:17
言語 Go
(1.23.4)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 1,907 bytes
コンパイル時間 14,019 ms
コンパイル使用メモリ 220,984 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-07-04 19:10:02
合計ジャッジ時間 14,374 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 13
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

package main
import (
"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.Stdin
wfp := os.Stdout
extra := 0
if 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) {
a := getNextString(scanner)
b := getNextString(scanner)
if isNum(a) == false {
fmt.Fprintln(writer, "NG")
return
}
if isNum(b) == false {
fmt.Fprintln(writer, "NG")
return
}
if max(a) == false {
fmt.Fprintln(writer, "NG")
return
}
if max(b) == false {
fmt.Fprintln(writer, "NG")
return
}
fmt.Fprintln(writer, "OK")
}
func max(a string) bool {
x := 0
n := len(a)
for i := 0; i < n; i++ {
x *= 10
x += int(a[i] - '0')
}
return x <= 12345
}
func isNum(a string) bool {
m := map[byte]int{}
for i := 0; i < 10; i++ {
m[byte('0'+i)] = 1
}
n := len(a)
for i := 0; i < n; i++ {
if m[a[i]] == 0 {
return false
}
}
return a == "0" || a[0] != '0'
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0