#280086 (Go) No.726 Tree Game

• 問題: No.726 Tree Game
• ユーザー: fmhr
• 提出日時: 2018-08-24 21:37:06
• 言語: Go (1.22.1)
• 結果: 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

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 10,624 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,248 KB
testcase_03	AC	1 ms; 5,248 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	WA	-
testcase_08	AC	1 ms; 5,376 KB
testcase_09	WA	-
testcase_10	AC	1 ms; 5,376 KB
testcase_11	WA	-
testcase_12	AC	1 ms; 5,376 KB
testcase_13	WA	-
testcase_14	AC	1 ms; 5,376 KB
testcase_15	WA	-
testcase_16	RE	-
testcase_17	RE	-
testcase_18	RE	-
testcase_19	RE	-
testcase_20	RE	-
testcase_21	RE	-
testcase_22	RE	-
testcase_23	TLE	-
testcase_24	--	-

ソースコード

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
}