손으로 만드는 나눗셈 계산표 with Julia

다음은 초등학교에서 배우는 나눗셈 계산표를 만들어주는 Julia 소스 코드이다.
나눗셈 계산표를 완성하고 나서 약수, 배수 관계를 알려준다.

1. ##  Filename: makeDivisionTable.jl
2. ##
3. ##  Purpose:  Make a division table in a handy written form.
4. ##
5. ##  Execute: julia makeDivisionTable.jl 12345 32
6. ##           julia makeDivisionTable.jl 500210 61
7. ##
8. ##      Date:  2013. 3. 5.
9. ##    Author:  pkim __AT__ scripts ((DOT)) pe ((DOT)) kr
11. function printUsage()
12.     # println("Using: julia makeDivisionTable.jl [numerator] [denominator]")
13.     # println("Make a division table in a handy written form.")
14.     println("사용법: julia makeDivisionTable.jl [피제수] [제수]")
15.     println("손으로 작성한 형태의 나눗셈 표를 만들어준다.")
16. end
18. function simplify(v, width)
19.     t = string(v)
20.     slen = length(t)
21.     if slen >=2 && t[slen-1:slen] == ".0"
22.         t = t[0:slen - 2]
23.     end
24.     slen = length(t)
25.     if slen < width
26.         t = " " ^(width - slen) * t
27.     end
28.     return t
29. end
31. function getSuffix(v)
32.     t = v % 10
33.     suffix = "은"
34.     if length(search("2459", "$t")) >= 1
35.         suffix = "는"
36.     end
37.     return suffix
38. end
40. function makeTable(numer, denom, quotient)
41.     strNumer = "$numer"
42.     strDenom = "$denom" 
43.     strQuotient = "$quotient"
44.     lenN = length(strNumer)
45.     lenD = length(strDenom)
46.     lenQ = length(strQuotient)
47.     offsetLeft = 3 + lenD + 3
48.     spaces = "                                                                                 "
49.     uline  = "_" ^ (lenN + 2)
50.     sline  = "-" ^ lenN
51.     bias = lenN - lenQ
52.     println(spaces[1:offsetLeft] * spaces[1:bias] * "$quotient")
53.     println(spaces[1:offsetLeft - 2] * uline)
54.     print("   " * strDenom * " ) " * strNumer)
55.     strTmpR = strNumer[1: bias + 1]
56.     tmpR = int64(strTmpR)
57.     tmpSub = int64(0) :: Int64
58.     oneDigit = ""
60.     for i = 1:lenQ
61.         if strQuotient[i: i] == "0"
62.             if i + 1 <= lenQ
63.                 oneDigit = strNumer[bias + i + 1: bias + i + 1]
64.                 print(oneDigit)
65.                 strTmpR = strTmpR * oneDigit
66.                 tmpR = int64(strTmpR)
67.             end
68.         else
69.             println("")
70.             tmpSub = int64(strQuotient[i: i]) * denom
71.             println(spaces[1: offsetLeft] * simplify(tmpSub, bias + i))
72.             println(spaces[1: offsetLeft] * sline)
73.             tmpR = tmpR - tmpSub
74.             if tmpR == 0 && i + 1 <= lenQ
75.                 print(spaces[1: offsetLeft] * spaces[1: bias + i])
76.             else
77.                 print(spaces[1: offsetLeft] * simplify(tmpR, bias + i))
78.             end
80.             strTmpR = "$tmpR"
81.             if i + 1 <= lenQ
82.                 oneDigit = strNumer[bias + i + 1: bias + i + 1]
83.                 if oneDigit != ""
84.                     print(oneDigit)
85.                     strTmpR = strTmpR * oneDigit
86.                 end
87.                 tmpR = int64(strTmpR)
88.             end
89.         end
90.     end
92.     println("")
93.     return tmpR
94. end
97. if length(ARGS) < 2
98.     printUsage()
99.     exit(1)
100. end
102. a = 0
103. b = 0
105. try
106.     a = int64(ARGS[1])
107.     b = int64(ARGS[2])
108. catch ex
109.     println(ex)
110.     @printf("피제수: %s, 제수: %s\n", ARGS[1], ARGS[2])
111.     println("숫자 입력에 오류가 있습니다.")
112.     exit(1)
113. end
115. if a <= 0
116.     @printf("피제수: %d\n", a)
117.     println("피제수는 양의 정수라야 합니다.")
118.     exit(1)
119. elseif b <= 0
120.     @printf("제수: %d\n", b)
121.     println("제수는 양의 정수라야 합니다.")
122.     exit(1)
123. end
125. q = int64(floor(a / b))
126. r = a % b
128. @printf("나눗셈 %s ÷ %s 의 결과: ", a, b)
129. @printf("몫: %d, ", q)
130. @printf("나머지: %ld\n", r)
131. println("")
133. k = makeTable(a, b, q)
135. if k == r
136.     @printf("\n나머지: %d\n", k)
137. end
139. if k == 0
140.     @printf("%d = %d x %d", a, b, q)
141.     @printf("%d%s %d의 배수(mupltiple)이다.\n", a, getSuffix(a), b)
142.     @printf("%d%s %d의 약수(divisor)이다.\n", b, getSuffix(b), a)
143. else
144.     @printf("%d = %d x %d + %d\n", a, b, q, r)
145.     @printf("%d%s %d의 배수(mupltiple)가 아니다.\n", a, getSuffix(a), b)
146. end
148. # -*- encoding: ms949 -*-
150. #  Filename: makeDivisionTable.py
151. #
152. #  Purpose:  Make a division table in a handy written form.
153. #
154. #  Execute: python makeDivisionTable.py 12345 32
155. #           python makeDivisionTable.py 500210 61
156. #
157. #     Date:  2008/05/15
158. #   Author:  PH Kim   [ pkim ((AT)) scripts.pe.kr ]
160. import sys
162. def printUsage():
163.     # print("Using: python makeDivisionTable.py [numerator] [denominator]")
164.     # print("Make a division table in a handy written form.")
165.     print("사용법: python makeDivisionTable.py [피제수] [제수]")
166.     print("손으로 작성한 형태의 나눗셈 표를 만들어준다.")
168. def simplify(v, width):
169.     t = "%ld" % v
170.     if t[-2:] == ".0":
171.         t = t[0:len(t) - 2]
172.     slen = len(t)
173.     if slen < width:
174.         t = " " * (width - slen) + t
175.     return t
177. def getSuffix(v):
178.     t = v % 10L
179.     suffix = "은"
180.     if "2459".find("%d" % t) >= 0:
181.         suffix = "는"
182.     return suffix
184. def makeTable(numer, denom, quotient):
185.     strNumer = "%ld" % numer
186.     strDenom = "%ld" % denom
187.     strQuotient = "%ld" % quotient
188.     lenN = len(strNumer)
189.     lenD = len(strDenom)
190.     lenQ = len(strQuotient)
191.     offsetLeft = 3 + lenD + 3
192.     spaces = "                                                                                 "
193.     uline  = "_" * (lenN + 2)
194.     sline  = "-" * lenN
195.     bias = lenN - lenQ
196.     print(spaces[0:offsetLeft] + spaces[0:bias] + "%ld" % quotient)
197.     print(spaces[0:offsetLeft - 2] + uline)
198.     sys.stdout.write("   " + strDenom + " ) " + strNumer)
200.     strTmpR = strNumer[0: bias + 1]
201.     tmpR = long(strTmpR)
202.     tmpSub = 0L
203.     oneDigit = None
205.     for i in range(0, lenQ):
206.         if strQuotient[i: i + 1] == "0":
207.             if i + 1 < lenQ:
208.                 oneDigit = strNumer[bias + i + 1: bias + i + 2]
209.                 sys.stdout.write(oneDigit)
210.                 strTmpR = strTmpR + oneDigit
211.                 tmpR = long(strTmpR)
212.         else:
213.             print
214.             tmpSub = long(strQuotient[i: i + 1]) * denom
215.             print(spaces[0: offsetLeft] + simplify(tmpSub, bias + i + 1))
216.             print(spaces[0: offsetLeft] + sline)
217.             tmpR = tmpR - tmpSub
218.             if tmpR == 0L and i + 1 < lenQ:
219.                 sys.stdout.write(spaces[0: offsetLeft] + spaces[0: bias + i + 1])
220.             else:
221.                 sys.stdout.write(spaces[0: offsetLeft] + simplify(tmpR, bias + i + 1))
223.             strTmpR = "%ld" % tmpR
224.             if i + 1 < lenQ:
225.                 oneDigit = strNumer[bias + i + 1: bias + i + 2]
226.                 if oneDigit != None:
227.                     sys.stdout.write(oneDigit)
228.                     strTmpR = strTmpR + oneDigit
229.                 tmpR = long(strTmpR)
231.     print
232.     return tmpR
235. if len(sys.argv) < 3:
236.     printUsage()
237.     exit(1)
239. a = None
240. b = None
242. try:
243.     a = long(sys.argv[1])
244.     b = long(sys.argv[2])
245. except ValueError:
246.     print("피제수: %s, 제수: %s" % (sys.argv[1], sys.argv[2]))
247.     print("숫자 입력에 오류가 있습니다.")
248.     sys.exit(1)
250. if a <= 0L:
251.     print("피제수: %ld" % a)
252.     print("피제수는 양의 정수라야 합니다.")
253.     sys.exit(1)
254. elif b <= 0L:
255.     print("제수: %ld" % b)
256.     print("제수는 양의 정수라야 합니다.");
257.     sys.exit(1)
259. q = a / b
260. r = a % b
262. sys.stdout.write("나눗셈 %ld ÷ %ld 의 결과: " % (a, b))
263. sys.stdout.write("몫: %ld, " % q)
264. print("나머지: %ld" % r)
265. print
267. k = makeTable(a, b, q)
269. if k == r:
270.     print("\n나머지: %ld" % k)
271. if k == 0L:
272.     print("%ld = %ld x %ld" % (a, b, q))
273.     print("%ld%s %ld의 배수(mupltiple)이다." % (a, getSuffix(a), b))
274.     print("%ld%s %ld의 약수(divisor)이다." % (b, getSuffix(b), a))
275. else:
276.     print("%ld = %ld x %ld + %ld" % (a, b, q, r))
277.     print("%ld%s %ld의 배수(mupltiple)가 아니다." % (a, getSuffix(a), b))
278. end

실행> julia makeDivisionTable.jl 500210 61

나눗셈 500210 ÷ 61 의 결과: 몫: 8200, 나머지: 10

          8200
      ________
   61 ) 500210
        488
        ------
         122
         122
        ------
            10

나머지: 10
500210 = 61 x 8200 + 10
500210은 61의 배수(mupltiple)가 아니다.