Jaime asm-jaime
asm-jaime
/ permutate_n.go
Last active
June 13, 2016 07:08
permutation sequence of n without repeats (input: 3, output: [012 021 102 120 201 210])
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import ( | |
| "fmt" | |
| "sort" | |
| "strconv" | |
| ) | |
| const num_count int = 3 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import ( | |
| "fmt" | |
| "strconv" | |
| ) | |
| const num int = 5 | |
| func main() { |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package main | |
| import ( | |
| "bufio" | |
| "os" | |
| "strconv" | |
| "strings" | |
| ) | |
| var scanner *bufio.Scanner = bufio.NewScanner(os.Stdin) |
NewerOlder