UPDATE I was informed by one of the participants that the name of the function penalizes certain potential approaches. As it is not my intention, I will change the name of the function that is being called to a one-character name of A(). While technically this is not a rule-change, I do realize that it can potentially affect the outcome. I will therefore recognize two first-round winners, one for the tightest code before the function name change, and a second one, if necessary, for the tightest code after the function name change. I will also notify all participants via PM of this change.
Let the sum of the square of the digits of a positive integer S0 be represented by S1. In a similar way, let the sum of the squares of the digits of S1 be represented by S2 and so on. If Si = 1 for some i >= 1, then the original integer S0 is said to be Happy number. A number which is not happy is called Unhappy number.
For example 7 is a Happy number since 7 -> 49 -> 97 -> 130 -> 10 -> 1 and 4 is an unhappy number since 4 -> 16 -> 37 -> 58 -> 89 -> 145 -> 42 -> 20 -> 4.
Determine whether the numbers provided in the input is a happy or unhappy number.
============= Inputs & Outputs =============
Input : A single positive integer number Output: 0 if input is an unhappy number and 1 if the number is a happy number
======= Scoring =======
All provided integers must be correctly categorized in order to have a valid Happy Number UDF and to have the KiXgolf score count.
============= General rules =============
The UDF must be written as one or more lines.
The UDF is expected to finish in a reasonable time, e.g. if it gets started when the challenge opens, it's expected to be finished by the time the challenge closes even on a somewhat slow computer. The UDF has to be valid during the period that the challenge runs.
You can submit scores as often as you want until the deadline, there's no reason to wait until the last minute for a score submission. In fact, other people want to see the score to beat. So don't be a spoilsport by hoarding your score. Submit early and often.
The UDF may only use the KiXtart/KiXforms commands/functions/macros, no other code fragments are allowed. Calls to cOM components that are part part of a standard default Windows installation are allowed.
Calls to other executables, as long as they are part of a standard default Windows installation are allowed.
The use of the KiXforms DLL is also permitted as the KiXforms DLL can now be considered an integral part of KiXtart scripting.
The UDF should be self-contained (except for any I/O mentioned in the challenge). In particular, you may not do things like fetching extra data from a remote site or file.
You may assume ASCII as character set.
You are not allowed to use additional code that is external to the KiXgolf UDF Collection. All code must be contained within the KiXgolf UDF Collection.
You are allowed to only use publicly available versions of KiXtart and KiXforms, private builds or alpha builds are NOT allowed
Your submitted score must include the KiXart/KiXforms version used.
When posting KiXtart Golf Scores, please include the KIXGOLF_*.TXT file that is created in the script directory. It contains some basic information about the computer that the script is run on and the resulting scores.
======== Deadlines ========
Private coding starts Friday, August 26, 2005, 6pm EST Private coding ends Wednesday, August 31, 2005, 6pm EST Public coding start Wednesday, August 31, 2005, 6pm EST Public coding ends Monday, September 5, 2005, 6pm EST
============ Test program ============
A test program is provided to help screen entries and to provide the Golf Score. Any program that passes the test program can be submitted. If you are surprised that your solution passed the test program, please submit it anyway! That will help me identify bugs in the test program.
================================================================ KiXtart GOLF - How To Play ================================================================
Most importantly, anybody can play, no age restrictions, no penalties, no handicap!
The object in "real" golf is to hit the ball in the hole in the fewest strokes. The object in KiXtart Golf is to get from input (tee) to target (hole) in the fewest keystrokes.
Example: How many positive elements are in array $a?
Array $a could be of structure $a=[1, 2 ,-3, 4, -5, -7, 8, 9]
One approach: [CODE]for $b=0 to ubound($a) if $a[$b]>0 $c=$c+1 endif next[/CODE]for a score of 45.
Another solution is: [CODE]DO $b=$b+1 if $a[$b]>0 $c=$c+1 endif UNTIL $b>(UBOUND($a)+1)[/CODE]for a score of 53.
Better approach: Code sample 1
================================================================ KiXtart GOLF - The Rules ================================================================
The goal of KiXtart Golf is to score the lowest strokes.
Strokes are all characters in a piece of code except whitespace characters, unless the whitespace character is necessary for the line of code to work. Therefore, carriage returns and line feeds do not count or spaces in between the '=' sign when assigning variables, e.g. '$a = $b' scores 5.
Code can be constructed any way you like, as long as it is syntactically correct with KiXtart.
The final solution MUST pass all test scripts that accompagny the KiXtart golf challenge.
The use of '$' as a variable is allowed.
In case of questions about a particular way to count the KiXtart Golf Challenge organizer has the last call.
During the private coding phase, no code is allowed to be posted. Violations result in disqualification of said player.
During the public coding phase, code should be posted, reused, and borrowed from other players.
The test script contains the official KiXgolf scoring engine
Edited by sealeopard (2005-08-2905:19 AM)
_________________________
There are two types of vessels, submarines and targets.
