-
Notifications
You must be signed in to change notification settings - Fork 28
Expand file tree
/
Copy path10487.go
More file actions
57 lines (51 loc) · 965 Bytes
/
10487.go
File metadata and controls
57 lines (51 loc) · 965 Bytes
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 10487 - Closest Sums
package main
import (
"fmt"
"math"
"os"
)
func abs(a int) int {
if a < 0 {
return -a
}
return a
}
func closestSum(num []int, s int) int {
var sum int
diff := math.MaxInt32
for i := 0; i < len(num)-1; i++ {
for j := i + 1; j < len(num); j++ {
newDiff := abs(s - num[i] - num[j])
if newDiff == 0 {
return num[i] + num[j]
}
if newDiff < diff {
diff = newDiff
sum = num[i] + num[j]
}
}
}
return sum
}
func main() {
in, _ := os.Open("10487.in")
defer in.Close()
out, _ := os.Create("10487.out")
defer out.Close()
var n, m, s int
for kase := 1; ; kase++ {
if fmt.Fscanf(in, "%d", &n); n == 0 {
break
}
num := make([]int, n)
for i := range num {
fmt.Fscanf(in, "%d", &num[i])
}
fmt.Fprintf(out, "Case %d:\n", kase)
for fmt.Fscanf(in, "%d", &m); m > 0; m-- {
fmt.Fscanf(in, "%d", &s)
fmt.Fprintf(out, "Closest sum to %d is %d.\n", s, closestSum(num, s))
}
}
}