-
Notifications
You must be signed in to change notification settings - Fork 28
/
Copy path10407.go
57 lines (50 loc) · 850 Bytes
/
10407.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
54
55
56
57
// UVa 10407 - Simple division
package main
import (
"bufio"
"fmt"
"os"
"sort"
"strings"
)
func gcd(a, b int) int {
if b == 0 {
return a
}
return gcd(b, a%b)
}
func solve(lst []int) int {
sort.Ints(lst)
for i := 1; i < len(lst); i++ {
lst[i] -= lst[0]
}
lst = lst[1:]
remainder := lst[0]
for i := 1; i < len(lst); i++ {
remainder = gcd(remainder, lst[i])
}
return remainder
}
func main() {
in, _ := os.Open("10407.in")
defer in.Close()
out, _ := os.Create("10407.out")
defer out.Close()
s := bufio.NewScanner(in)
s.Split(bufio.ScanLines)
var line string
var tmp int
for s.Scan() {
if line = s.Text(); line == "0" {
break
}
var lst []int
for r := strings.NewReader(line); ; {
if fmt.Fscanf(r, "%d", &tmp); tmp == 0 {
break
}
lst = append(lst, tmp)
}
fmt.Fprintln(out, solve(lst))
}
}