提出 #36815608


ソースコード 拡げる

package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

const SPACE = " "

func dump(x ...interface{}) {
	fmt.Printf("%+v\n", x...)
}

func toInt64(s string) int64 {
	n, _ := strconv.ParseInt(s, 10, 64)
	return n
}

func newBuffer() *buffer {
	return &buffer{
		bufio.NewScanner(os.Stdin),
	}
}

type buffer struct {
	scanner *bufio.Scanner
}

func (b *buffer) readLine() string {
	b.scanner.Scan()
	return b.scanner.Text()
}

func (b *buffer) readInt64() int64 {
	return toInt64(b.readLine())
}

func (b *buffer) readStrings(sep string) []string {
	s := strings.Split(b.readLine(), " ")
	return s
}

func (b *buffer) readInt64s(sep string) []int64 {
	ss := b.readStrings(sep)
	res := make([]int64, len(ss))
	for i, s := range ss {
		res[i] = toInt64(s)
	}
	return res
}

func main() {
	input := newBuffer()

	s := input.readLine()
	t := input.readLine()

	fmt.Printf("%s\n", map[bool]string{
		false: "No",
		true:  "Yes",
	}[strings.Contains(s, t)])
}

提出情報

提出日時
問題 B - LOOKUP
ユーザ sters
言語 Go (1.14.1)
得点 200
コード長 1033 Byte
結果 AC
実行時間 7 ms
メモリ 1772 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 200 / 200
結果
AC × 4
AC × 48
セット名 テストケース
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt
ケース名 結果 実行時間 メモリ
hand_01.txt AC 7 ms 1772 KiB
hand_02.txt AC 2 ms 1756 KiB
hand_03.txt AC 2 ms 1772 KiB
hand_04.txt AC 2 ms 1756 KiB
sample_01.txt AC 1 ms 1772 KiB
sample_02.txt AC 2 ms 1752 KiB
sample_03.txt AC 2 ms 1756 KiB
sample_04.txt AC 2 ms 1752 KiB
test_01.txt AC 2 ms 1752 KiB
test_02.txt AC 1 ms 1756 KiB
test_03.txt AC 2 ms 1768 KiB
test_04.txt AC 2 ms 1760 KiB
test_05.txt AC 3 ms 1752 KiB
test_06.txt AC 3 ms 1752 KiB
test_07.txt AC 2 ms 1756 KiB
test_08.txt AC 2 ms 1756 KiB
test_09.txt AC 2 ms 1756 KiB
test_10.txt AC 2 ms 1756 KiB
test_11.txt AC 2 ms 1752 KiB
test_12.txt AC 2 ms 1760 KiB
test_13.txt AC 2 ms 1768 KiB
test_14.txt AC 2 ms 1760 KiB
test_15.txt AC 2 ms 1768 KiB
test_16.txt AC 2 ms 1768 KiB
test_17.txt AC 2 ms 1756 KiB
test_18.txt AC 2 ms 1756 KiB
test_19.txt AC 2 ms 1752 KiB
test_20.txt AC 2 ms 1752 KiB
test_21.txt AC 2 ms 1756 KiB
test_22.txt AC 2 ms 1760 KiB
test_23.txt AC 2 ms 1764 KiB
test_24.txt AC 2 ms 1760 KiB
test_25.txt AC 3 ms 1760 KiB
test_26.txt AC 2 ms 1752 KiB
test_27.txt AC 2 ms 1768 KiB
test_28.txt AC 2 ms 1752 KiB
test_29.txt AC 2 ms 1756 KiB
test_30.txt AC 2 ms 1760 KiB
test_31.txt AC 2 ms 1756 KiB
test_32.txt AC 2 ms 1756 KiB
test_33.txt AC 2 ms 1752 KiB
test_34.txt AC 2 ms 1756 KiB
test_35.txt AC 1 ms 1760 KiB
test_36.txt AC 2 ms 1760 KiB
test_37.txt AC 2 ms 1756 KiB
test_38.txt AC 3 ms 1760 KiB
test_39.txt AC 2 ms 1752 KiB
test_40.txt AC 2 ms 1752 KiB