-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path10815.go
53 lines (47 loc) · 892 Bytes
/
10815.go
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
// UVa 10815 - Andy's First Dictionary
package main
import (
"fmt"
"os"
"sort"
"strings"
)
func isAlphabet(b byte) bool { return b >= 'a' && b <= 'z' || b >= 'A' && b <= 'Z' }
func toLower(b byte) byte {
if b >= 'A' && b <= 'Z' {
return b - 'A' + 'a'
}
return b
}
func main() {
in, _ := os.Open("10815.in")
defer in.Close()
out, _ := os.Create("10815.out")
defer out.Close()
var b byte
var word []byte
wordMap := make(map[string]bool)
var started bool
for {
if _, err := fmt.Fscanf(in, "%c", &b); err != nil {
break
}
switch {
case isAlphabet(b):
if !started {
word = nil
started = true
}
word = append(word, toLower(b))
case started:
wordMap[string(word)] = true
started = false
}
}
var words []string
for k := range wordMap {
words = append(words, k)
}
sort.Strings(words)
fmt.Fprintln(out, strings.Join(words, "\n"))
}