#24215 (Go1.4) No.201 yukicoderじゃんけん

• 問題: No.201 yukicoderじゃんけん
• ユーザー: gogotea
• 提出日時: 2015-05-03 23:45:44
• 言語: Go1.4 (1.4.2)
• 結果: AC
• 実行時間: 2 ms / 5,000 ms
• コード長: 2,359 bytes
• コンパイル時間: 457 ms
• コンパイル使用メモリ: 33,792 KB
• 実行使用メモリ: 6,824 KB
• 最終ジャッジ日時: 2024-11-25 00:16:44
• 合計ジャッジ時間: 1,245 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
other	AC * 20

ソースコード

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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
package main
import (
    "bufio"
    "fmt"
    "io"
    "log"
    "os"
    "strconv"
)
func main() {
    es := NewErrScanner(os.Stdin)
    const numOfPlayers = 2
    players := make([]*player, numOfPlayers)
    for i := 0; i < numOfPlayers; i++ {
        name := es.Next()
        points := es.Next()
        es.Next()
        players[i] = NewPlayer(name, points)
    }
    if es.Err() != nil {
        log.Fatal(es.Err())
        return
    }
    fmt.Println(solve(players[0], players[1]))
}
func solve(a, b *player) string {
    switch {
    case len(a.points) > len(b.points):
        return a.name
    case len(a.points) < len(b.points):
        return b.name
    default:
        for i := 0; i < len(a.points); i++ {
            if a.points[i] > b.points[i] {
                return a.name
            }
            if a.points[i] < b.points[i] {
                return b.name
            }
        }
        return "-1"
    }
}
type player struct {
    name   string
    points string
}
func NewPlayer(name string, points string) *player {
    return &player{
        name,
        points,
    }
}
type scanner struct {
    *bufio.Scanner
}
func NewScanner(r io.Reader) *scanner {
    return &scanner{
        bufio.NewScanner(r),
    }
}
func (s *scanner) Next() (string, error) {
    s.Scanner.Split(bufio.ScanWords)
    return s.nextToken()
}
func (s *scanner) NextLine() (string, error) {
    s.Scanner.Split(bufio.ScanLines)
    return s.nextToken()
}
func (s *scanner) nextToken() (string, error) {
    sc := s.Scanner
    if sc.Scan() {
        return sc.Text(), nil
    }
    if sc.Err() != nil {
        return "", sc.Err()
    }
    return "", io.EOF
}
func (s *scanner) NextInt() (int, error) {
    token, err := s.Next()
    if err != nil {
        return 0, err
    }
    return strconv.Atoi(token)
}
func (s *scanner) NextLong() (int64, error) {
    token, err := s.Next()
    if err != nil {
        return 0, err
    }
    return strconv.ParseInt(token, 10, 64)
}
type errScanner struct {
    sc  *scanner
    err error
}
func NewErrScanner(r io.Reader) *errScanner {
    return &errScanner{
        sc: NewScanner(r),
    }
}
func (e *errScanner) Err() error {
    return e.err
}
func (e *errScanner) Next() (token string) {
    if e.err != nil {
        return
    }
    token, e.err = e.sc.Next()
    return
}
func (e *errScanner) NextLine() (line string) {
    if e.err != nil {
        return
    }
    line, e.err = e.sc.NextLine()
    return
}
func (e *errScanner) NextInt() (n int) {
    if e.err != nil {
        return
    }
    n, e.err = e.sc.NextInt()
    return
}
func (e *errScanner) NextLong() (n int64) {
    if e.err != nil {
        return
    }
    n, e.err = e.sc.NextLong()
    return
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX