I will do the change to html, because Kerm gave me some cool code to work with, to kind of "Block" code, you know how you would use the [ code] comments?

Makes it look all fancy and stuff...

Thank you. I truly hope so. I cleaned the page up a bit, as per requested by axcho. I have done everything he asks, so I am sure it will be officially posted sometime today...

No, that was by elfprince, and is at

http://tifreakware.calcgames.org/nolib.htm

This is slightly different, and has some info the other did not.

22, I have been running a wrecker since I was 8, and driving (on the interstate) since I was 14.

And I don't know about the blue car, they were listed as critical last we heard...

I understand how you feel. I too was always trying to think of other people all the time. After being hurt constantly, I gave up on them. I came to the realization that I am a person that simply has higher morals than most people, and I care what happens to people in general. But people take advantage of that, and of you, and don't care what happens to you, only that they get what they want.

What helps? I read books. I throw myself into them, making myself the main character, and completely focus on it. If you like medeval books, please look into Terry Goodkind. Believe it or not, he actually kept me from doing the deed.

And do not think people do not care about you. You are one of the few friends that I have on the net. You have a lot of people I am sure care there, like your family.

If nothing else, take up other interests, that will make you focus completely on the hobby. That is what I found that works.


I really hope you do nothing drastic, my friend.

Not tellin you how to run things, but...

For(A,1,100
randInt(0,1
If not(Ans:Ans+1->C
If Ans:Ans+1->D
End

This might have been a little more fair in the deciding process...

QuoteBegin-MathStuf+24 January 2006, 21:12-->

QUOTE (MathStuf @ 24 January 2006, 21:12)

Or, to save space, find a way to extract bits from a decimal number. 33 flags can be stored in any number up to 2^33 and that takes 18 bytes for storage compared to 44 bytes for a string with the same amount of bytes. I may be able to write a BASIC routine that can test whether a single flag in a decimal number is set or not. If you have enough flags, it will pay off for itself in memory later. Flag Check: c1--> CODE ec1 // F is the flag to check // 1 is returned in S if it's set, 0 otherwise // Save the flag so we don't modify it LFLAG(1+iPart(F/33->G // Move from the left most bit in the flagkey // to the right so that they don't interfere // with the flag we're looking for For(A,33,33-33fPart(F/33),-1 // If the flag is larger than the power, the flag at that value is set 2^AS // Subtract that value off of the temporary value G-S2^A->G End c2 ec2 Set: c1 --> CODE ec1 // If that flag isn't set, set it by adding // the value of that flag within the flagkey LFLAG(1+iPart(F/33))+not(S)2^(33-33fPart(F/33->LFLAG(1+iPart(F/33 c2 ec2 Unset: c1 --> CODE ec1 // If that flag is set, unset it by subtracting // the value of that flag within the flagkey LFLAG(1+iPart(F/33))-S2^(33-33fPart(F/33->LFLAG(1+iPart(F/33 c2 ec2 Flip: c1 --> CODE ec1 // Subtract the flag if it's set, add it if it's not // (2S-1) is -1 if the flag is unset (adds to the flagkey) // (2S-1) is 1 if the flag is set (subtracts from the flagkey) LFLAG(1+iPart(F/33))-(2S-1)2^(33-33fPart(F/33->LFLAG(1+iPart(F/33 c2 ec2 I've fixed the code to work here (I'm too used to arrays starting at 0 now because of C). I also condensed it a bit. Hope this helps clarify. EDIT: Wow...I messed that up between editing/making new post...