laratime.ZXZ [1/1]

Hаписал я программку, которая запускается перед запуском Лары и в 9 сектор
0 дороги прописывает время из часов по схеме модифицированной глюка.
Модифицированная она потому, что я забыл про 7 бит #eff7 :-( Hо у меня в
компутере он не проверяется :-) Так что я думаю программа мало кому нужна,
но вдруг пригодится ? Занимает она мало, поэтому и заюючил.

Чтобы не было вопросов - это ZXZIP спектрумовский !
(на спектруме в ZIP переименовать надо).

section 1 of 1 of file laratime.Z < Lara Croft 3.30 UUE >
begin 644 laratime.ZXZ
M3$%202`@("!"W0#=``'-`"!$;S0#``$&'`U0?<""`4,"_!\1(<#F$WN&A(:\
M]:X&"6KT#9+KR(D0\0>\_]WGPO9Y#?YNC]<\090%?2:7::P[Z1-(T\V8]R\V
M(MN#,`=&A'YP\%>8`2G.'2EWI$^$S6MW]7F`6`D0JP!B?S7L`0VM[XZT"7!D\N)/S<-_>/3A0\!'\YHC/GARJDF;%E6I(I@W!"BP(L#^L$7.E'G3
MYDV1.O,#4U[F3)PW98K`?F!&`,X:LZ;-F#FR5Z_SODBF8>6&!3G3Y0SN`:L6
""!`
`
end
sum -r/size 51853/342 section
sum -r/size 40903/227 entire input file

KF> I wrote a program that runs before starting
KF> Lara and in the 9th sector
KF> 0 of the road it registers the time from the clock according to the
KF> scheme of a modified glitch. It is modified because I
KF> forgot about the 7th bit #eff7 :-( But on my
KF> computer it is not checked :-) So I think the
KF> program is not needed by many people,
KF> but what if it comes in handy? It doesn't take up much, that's why
KF> got stuck.

[skip]

I wrote this thing when 1.40 appeared, like... and
I attached it to Lara, and then the versions began to change so often that
I'm still too lazy to redo it... :)

and now the main thing: how did you solve the contradiction
1) the clock stores 2 digits of the year
2) in Lara you need 4 numbers.

what will happen after December 31, 1999?
Let's go back to the last century?
:)

bye.

One day 04 Dec 98 at 21:47:54 comrade Renat Mamedov noticed comrade
Kirill Frolov about , where I intervened:

RM> and now the main thing: how did you solve the contradiction
RM> 1) the clock stores 2 digits of the year
RM> 2) in Lara you need 4 digits.

RM> what will happen after December 31, 1999?
RM> Let's go back to the last century?

Why is it difficult to determine with a driver? if the year of the clock is less than, for example,
98,
then this is already the next century. IMHO, no problem :)

With the best, Denis Dmitriev.

... I’ll buy a moonshine still. intermediary phone number 02.

It was 04 Dec 98 and 21:47:54, Renat Mamedov wrote to Kirill Frolov
on the topic laratime.ZXZ [1/1]
Not seeing a moderator nearby, I decided to insert a word:

RM> attached it to Lara, and then the versions began to change so often that
RM> I’m still too lazy to redo it... :)

So you need to keep it a separate program - then it will depend little on the version.

KF> It will be January 1, 2000. If the year is less than 98 -
KF> it is definitely 20XX. Otherwise 19XX.

KF> But I also know what will happen after 2097 - glitches.

so. clear.
I wonder how they got around it on the pussy...

This is the version of the investigation. I said.

DD> Why is it difficult to determine by the driver? if the year of the clock is less than, for example,
DD> 98, then this is already the next century. IMHO, no problem :)

What about in 2099? :))

Warm greetings, Slava!

KF>> And I also know what will happen after 2097 - glitches.
RM> so. clear.
RM> I wonder how they got around this on the pussy...

Boom... IMHO, it's pure hara-kiri :)

So!
this is all easily solved!
We allocate two bytes in the memory area in CMOS-e, one of them stores the number of the current
century, and the second - the number of the current year (ibn "19" and "98").
If the driver accesses the clock and finds that the number of the stored year is greater
than the one that the clock calculates, then we increment the number century.
After which we remember the obtained results of the century and year there in space.

Questions?

ps: it will work only until the year 25599 :(

DD> So!
DD> this is all easily solved!
DD> We allocate two bytes in the memory area in CMOS-e, one of them
DD> stores the number of the current
DD> century, and the second - the number of the current year (ibn "19" and "98").
DD> If the driver reaches into the clock and finds that the
DD> number of the stored year more
DD> than the one that the clock counts, then we increment the number
DD> of the century.
DD> After which we remember the obtained results of the century and year there
DD> in space.

DD> Questions?

This feature will be needed every 100 years... :) then write
special. utility... like "meet the new century with dignity!" :). (partial) with the Finnish clock.
And it was easier for me (and it will be easier for everyone) to print directly
from bcd, and if the author of Lara uses binary, then I am almost sure that during the printing process he converts to bcd...

thus, whoever answers first will receive a piece of candy: in connection with
the global changes in mail routing in 5026, I
have suspicions of my own invisibility... plz
confirm...