-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path1714C.go
95 lines (79 loc) · 1.14 KB
/
1714C.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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
package main
import (
"bufio"
"fmt"
"os"
"strconv"
)
var in, out = bufio.NewReader(os.Stdin), bufio.NewWriter(os.Stdout)
func solve() string {
var s int
fmt.Fscan(in, &s)
if s < 10 {
return strconv.FormatInt(int64(s), 10)
}
var num = make([]int, 0)
var cs = s
for i := 9; i > 0; i-- {
if cs-i > 0 {
cs -= i
num = append(num, i)
} else {
break
}
}
num = append(num, cs)
var res string
for i := len(num) - 1; i >= 0; i-- {
res += strconv.FormatInt(int64(num[i]), 10)
}
return res
}
func main() {
defer out.Flush()
var t int
for fmt.Fscanln(in, &t); t > 0; t-- {
fmt.Fprintln(out, solve())
}
}
// util functions
func xiny(x []int, y int) bool {
for _, a := range x {
if a == y {
return true
}
}
return false
}
func sum(x []int) int {
var res int
for _, a := range x {
res += a
}
return res
}
func max(x, y int) int {
if x > y {
return x
}
return y
}
func min(x, y int) int {
if x < y {
return x
}
return y
}
func abs(x int) int {
if x < 0 {
return -x
}
return x
}
func makeMatrix(n, m int) [][]int {
x := make([][]int, n)
for i := range x {
x[i] = make([]int, m)
}
return x
}