#280086 (Go) No.726 Tree Game

• 問題: No.726 Tree Game
• ユーザー: fmhr
• 提出日時: 2018-08-24 21:37:06
• 言語: Go (1.23.4)
• 結果: WA
• 実行時間: -
• コード長: 2,120 bytes
• コンパイル時間: 14,390 ms
• コンパイル使用メモリ: 225,260 KB
• 実行使用メモリ: 230,636 KB
• 最終ジャッジ日時: 2024-06-23 06:51:10
• 合計ジャッジ時間: 18,337 ms
• ジャッジサーバーID （参考情報）: judge2 / judge5

ファイルパターン	結果
other	AC * 11 WA * 5 RE * 7 TLE * 1 -- * 1

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
package main
import (
    "bufio"
    "bytes"
    "fmt"
    "log"
    "os"
    "strconv"
)
// const abcd = "abcdefghijklmnopqrstuvwxyz"
// const ABCD = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
var dr = [...]int{0, 1, 1, 1, 0, -1, -1, -1, 0}
var dc = [...]int{1, 1, 0, -1, -1, -1, 0, 1, 0}
func Sieve(n int) []bool {
    prime := make([]int, n+1)
    isPrime := make([]bool, n+1)
    p := 0
    for i := 0; i <= n; i++ {
        isPrime[i] = true
    }
    isPrime[0] = false
    isPrime[1] = false
    for i := 2; i <= n; i++ {
        if isPrime[i] {
            p++
            prime[p] = i
            for j := 2 * i; j <= n; j += i {
                isPrime[j] = false
            }
        }
    }
    return isPrime
}
func main() {
    log.SetFlags(log.Lshortfile)
    nextReader = NewScanner()
    Y := nextInt()
    X := nextInt()
    log.Println(Y, X)
    isPrime := Sieve(max(Y+2, X+2))
    yb := isPrime[Y+1]
    xb := isPrime[X+1]
    if yb && xb {
        fmt.Println("Second")
    } else {
        fmt.Println("First")
    }
}
func max(a ...int) int {
    r := a[0]
    for i := 0; i < len(a); i++ {
        if r < a[i] {
            r = a[i]
        }
    }
    return r
}
func min(a ...int) int {
    r := a[0]
    for i := 0; i < len(a); i++ {
        if r > a[i] {
            r = a[i]
        }
    }
    return r
}
func sum(a []int) (r int) {
    for i := range a {
        r += a[i]
    }
    return r
}
func minmax(a, b int) (int, int) {
    if a > b {
        return b, a
    }
    return a, b
}
func abs(a int) int {
    if a < 0 {
        return -a
    }
    return a
}
func printInts(out []int, str string) {
    var bb bytes.Buffer
    for i := range out {
        bb.WriteString(strconv.Itoa(out[i]))
        bb.WriteString(str)
    }
    fmt.Println(bb.String())
}
var nextReader func() string
func NewScanner() func() string {
    r := bufio.NewScanner(os.Stdin)
    r.Buffer(make([]byte, 1024), int(1e+11))
    r.Split(bufio.ScanWords)
    return func() string {
        r.Scan()
        return r.Text()
    }
}
func nextString() string {
    return nextReader()
}
func nextInt64() int64 {
    v, _ := strconv.ParseInt(nextReader(), 10, 64)
    return v
}
func nextInt() int {
    v, _ := strconv.Atoi(nextReader())
    return v
}
func nextInts(n int) []int {
    r := make([]int, n)
    for i := 0; i < n; i++ {
        r[i] = nextInt()
    }
    return r
}
func nextFloat64() float64 {
    f, _ := strconv.ParseFloat(nextReader(), 64)
    return f
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX