|
|
|
package main
|
|
|
|
|
|
|
|
import (
|
|
|
|
"math/rand"
|
|
|
|
|
|
|
|
"./student"
|
|
|
|
"github.com/01-edu/public/go/lib"
|
|
|
|
)
|
|
|
|
|
|
|
|
func nRune(s string, n int) rune {
|
|
|
|
if n > len(s) || n < 1 {
|
|
|
|
return 0
|
|
|
|
}
|
|
|
|
runes := []rune(s)
|
|
|
|
return runes[n-1]
|
|
|
|
}
|
|
|
|
|
|
|
|
func main() {
|
|
|
|
type node struct {
|
|
|
|
word string
|
|
|
|
n int
|
|
|
|
}
|
|
|
|
|
|
|
|
table := []node{}
|
|
|
|
|
|
|
|
for i := 0; i < 30; i++ {
|
|
|
|
wordToInput := lib.RandASCII()
|
|
|
|
val := node{
|
|
|
|
word: wordToInput,
|
|
|
|
n: rand.Intn(len(wordToInput)) + 1,
|
|
|
|
}
|
|
|
|
table = append(table, val)
|
|
|
|
}
|
|
|
|
|
|
|
|
table = append(table,
|
|
|
|
node{word: "Hello!", n: 3},
|
|
|
|
node{word: "Salut!", n: 2},
|
|
|
|
node{word: "Ola!", n: 4},
|
|
|
|
node{word: "♥01!", n: 1},
|
|
|
|
node{word: "Not", n: 6},
|
|
|
|
node{word: "Also not", n: 9},
|
|
|
|
node{word: "Tree house", n: 5},
|
|
|
|
node{word: "Whatever", n: 0},
|
|
|
|
node{word: "Whatshisname", n: -2},
|
|
|
|
)
|
|
|
|
|
|
|
|
for _, arg := range table {
|
|
|
|
lib.Challenge("NRune", student.NRune, nRune, arg.word, arg.n)
|
|
|
|
}
|
|
|
|
}
|