-
Notifications
You must be signed in to change notification settings - Fork 27
/
Copy path146.go
54 lines (48 loc) · 789 Bytes
/
146.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
// UVa 146 - ID Codes
package main
import (
"fmt"
"os"
"sort"
"strings"
)
func nextPermutation(p []string) bool {
n := len(p)
i := n - 1
for i > 0 && p[i-1] >= p[i] {
i--
}
if i == 0 {
return false
}
mp := i
for j := i + 1; j < n; j++ {
if p[j] > p[i-1] && p[j] < p[mp] {
mp = j
}
}
p[mp], p[i-1] = p[i-1], p[mp]
sort.Strings(p[i:n])
return true
}
func main() {
in, _ := os.Open("146.in")
defer in.Close()
out, _ := os.Create("146.out")
defer out.Close()
var line string
for {
if fmt.Fscanf(in, "%s", &line); line == "#" {
break
}
p := make([]string, len(line))
for i := range line {
p[i] = string(line[i])
}
if nextPermutation(p) {
fmt.Fprintln(out, strings.Join(p, ""))
} else {
fmt.Fprintln(out, "No Successor")
}
}
}