17 Apr
1999
17 Apr
'99
9:39 p.m.
A non-text attachment was scrubbed...
Name: not available
Type: text
Size: 3663 bytes
Desc: not available
Url :
http://www.classiccmp.org/pipermail/cctalk/attachments/19990418/1067c2c5/at…
17 Apr
17 Apr
9:44 p.m.
A non-text attachment was scrubbed...
Name: not available
Type: text
Size: 577 bytes
Desc: not available
Url :
http://www.classiccmp.org/pipermail/cctalk/attachments/19990418/dc6319f1/at…
10:14 p.m.
A non-text attachment was scrubbed...
Name: not available
Type: text
Size: 4296 bytes
Desc: not available
Url :
http://www.classiccmp.org/pipermail/cctalk/attachments/19990418/18db33fb/at…
18 Apr
18 Apr
8:05 a.m.
We also need a separate "anything goes" cataegory, so that we can see what
Tony and Allison can come up with!
19 Apr
19 Apr
12:08 p.m.
On Sun, 18 Apr 1999, Sean 'Captain Napalm' Conner wrote:
Problem: Convert a binary value to Roman, using ASCII
characters (or
the native character set if applicable) into a string
with a termination character (if ASCII, use the NUL (0)
character).
The valid Roman characters used are:
I 1
V 5
X 10
L 50
C 100
D 500
M 1000
I will assume that all are familiar with how the conversion
goes 8-) The smallest value allowed is 1, and the largest
is 3,999. Any value out of this range is to be represented
as a single character consisting of an asterick (*) or some
other similar character in whatever character set (if ASCII
isn't supported) followed by the termination character.
This means that the longest string is 10 characters long:
`M' `M' `M' `C' `M' `X' `C' `I' `X'
<termination>
I must be missing something here. 9 does NOT produce the longest string
< 10, 8 does. (IX v VIII), and 3999 isn't the longest string.
3888 would seem to produce:
M M M D C C C L X X X V I I I \0
which is 16 characters, including null.
BTW, what comes after M? Is it correct that in Roman numerals there can
never be 4 consecutive occurences of the same letter? (The original Y4M
"bug"!!!)
--
Fred Cisin cisin(a)xenosoft.com
XenoSoft http://www.xenosoft.com
2210 Sixth St. (510) 644-9366
Berkeley, CA 94710-2219
2:07 p.m.
I just looked at a reference which mentioned an inscription in the Forum
on the columna rostrata commemorating the victory of the Carthaginians in
260 BC which had 23 (I)'s inscribed, where I=1,000.
On Mon, 19 Apr 1999, Fred Cisin (XenoSoft) wrote:
On Sun, 18 Apr 1999, Sean 'Captain Napalm'
Conner wrote:
M. K. Peirce
Rhode Island Computer Museum, Inc.
215 Shady Lea Road,
North Kingstown, RI 02852
"Casta est qui nemo rogavit."
- Ovid
Problem: Convert a binary value to Roman, using
ASCII characters (or
the native character set if applicable) into a string
with a termination character (if ASCII, use the NUL (0)
character).
The valid Roman characters used are:
I 1
V 5
X 10
L 50
C 100
D 500
M 1000
I will assume that all are familiar with how the conversion
goes 8-) The smallest value allowed is 1, and the largest
is 3,999. Any value out of this range is to be represented
as a single character consisting of an asterick (*) or some
other similar character in whatever character set (if ASCII
isn't supported) followed by the termination character.
This means that the longest string is 10 characters long:
`M' `M' `M' `C' `M' `X' `C' `I' `X'
<termination>
I must be missing something here. 9 does NOT produce the longest string
< 10, 8 does. (IX v VIII), and 3999 isn't the longest string.
3888 would seem to produce:
M M M D C C C L X X X V I I I \0
which is 16 characters, including null.
BTW, what comes after M? Is it correct that in Roman numerals there can
never be 4 consecutive occurences of the same letter? (The original Y4M
"bug"!!!)
--
Fred Cisin cisin(a)xenosoft.com
XenoSoft http://www.xenosoft.com
2210 Sixth St. (510) 644-9366
Berkeley, CA 94710-2219
9208
days inactive
9209
days old
5 comments
3 participants
participants (3)
-
at258＠osfn.org -
cisin＠xenosoft.com -
spc＠armigeron.com