May 93 Challenge
 Volume Number: 9 Issue Number: 5 Column Tag: Programmers’ Challenge

# Programmers’ Challenge

By Mike Scanlin, MacTech Magazine Regular Contributing Author

Note: Source code files accompanying article are located on MacTech CD-ROM or source code disks.

Thanks to WarrenPM (America Online) for suggesting this month’s Challenge: Find all of the correct addition problems of the form: 123 + 456 = 789 using each of the digits 1 through 9 once each in every solution. For example: 124 + 659 = 783 is true, uses only the digits 1 through 9 and uses each only once.

The prototype of the function you write is:

```unsigned short CountMagicAdditions();
```

You’re not required to produce the actual equations as output, only the correct number of them. Note: This does not mean you should write a separate function that precomputes the answer and then submit a solution that consists of return (kNumMagicAdditions);. Also note that “124 + 659 = 783” and “659 + 124 = 783” are the same thing and only count as 1 magic addition.

Warren says that he wrote a version in AppleSoft BASIC years ago that did lots of string manipulation and took two days to run on his Apple ][. Hopefully your solution in C on my Quadra 700 will run somewhat faster. If you’re really motivated, you could make CountMagicAdditions take a parameter n which would range in value from 3 to 9 and would represent the number of digits used by each equation (and the values of the digits are from 1 to n). For instance: “1 + 2 = 3” is the only solution when n = 3. This more general purpose routine is not required to win the Challenge, though.

## TWO MONTHS AGO WINNER

This month we have our first repeat winner of the Programmer’s Challenge. Congratulations to Ronald Nepsund (Northridge, CA) for winning the “Count Unique Words” challenge (Ronald previously won the Travelling Salesman challenge). Close behind, with similar algorithms but slightly different implementations are David Biolsi (Ithaca, NY) and Richard Parker (Irvine, CA).

Here’s a summary of the entries that didn’t crash. The bytes column is the code size, test 1 is the ticks to complete a 17K input file yielding 796 unique words; and test 2 is the ticks to complete a 40K input file yielding 817 unique words (each test was run 20 times and the ticks represent the total time for all instances of each of the two tests):

Name bytes test 1 test 2

Ronald Nepsund 660 63 127

David Biolsi 636 86 146

Richard Parker 386 96 168

Bob Boonstra 856 107 212

JohnnyL 782 124 247

Stepan Riha 418 157 248

Mark Nilsen 588 137 264

Dave Darrah 266 6180 16240

Thank you to all the people who responded to my request for feedback on this column. I will implement as many of your good ideas as I can. The basic feeling was that the challenges are about the right difficulty level as they are but that once in a while a really hard or really easy one might be nice. The vote on Mac-only vs. platform-independent Challenges is split 50/50.

Several people complained about not having enough time to work on the challenge. Neil is working on a way to make the new challenges available electronically before the issue that contains them arrives in your mail box. [Check the online services for more information. See page two for info on which services we support. - Ed.] Hopefully that will help. The other option is to separate the challenge from the solution by three months instead of two. If the electronic option doesn’t help then we may go that route.

I received my second complaint that I don’t provide enough info in the challenge specification to adequately solve it. For instance, in the Count Unique Words challenge one person wondered if he was allowed to overwrite the input buffer or not. Well, I don’t think I’m capable of predicting all such questions up front but I will make more of an effort to eliminate confusion. Also, in the event that I give a less than clear specification, you can always e-mail me at one of the Challenge addresses for clarification (which is probably better than making a really gross wrong assumption and having your entry disqualified).

One question raised by two people that relates to the specification issue is the ANSI compatibility issue and whether or not you’re allowed to make toolbox calls. I had assumed that since this was a Mac magazine people would feel free to call NewPtr instead of malloc (as many who have submitted solutions have done). I guess that was a bad assumption. So, the rules now state that you may make toolbox calls if you want to. There will probably be a Challenge some day that is Mac-specific and requires toolbox interaction but you’re certainly not required to use the toolbox if arriving at the solution doesn’t necessitate it (do whatever is fastest!).

## TRAVELLING SALESMAN NOTE

Thanks to Stepan Riha (Austin, TX) for pointing out a further optimization in the Travelling Salesman winning solution. Since you’re not really concerned with the actual distance between points but only the relative distance between points, you don’t need to use square root at all; you can just compare the squares of the distances instead (which is faster). As Stepan says, “A careful analysis of a problem can often improve performance better than careful optimization. Combination of the two gives you truly great code!”

## Here’s Ronald’s Count Unique Words winning solution:

```/*****************************************************
* Unique word count by Ronald M. Nepsund
*
* The original text is uppercased with all non
* alphabetic characters turned to zero. The list of
* unique words works as follows: The word is used to
* to index into a 1024 entry hash table. The hash
* table contains pointers to the beginning of a linked
* list of word entries. Each word entry holds the
* length of the word and a pointer to the first
* occurance of the word in the original text. The
* linked list is ordered first by the length of the
* words and secondly alphabetically
****************************************************/

#define kHashSize0x00400

typedef struct tNode{
short  length;
Ptr    wordPtr;
struct tNode    *nextNode;
} WordTableRec, *WordTablePtr;

/* compare two strings */
short stringCmp(register short length,
register char *pnt1,
register char *pnt2)
{
while (-length > 0 && *pnt1==*pnt2) {
pnt1++; pnt2++;
}
return *pnt1-*pnt2;
}

unsigned short
CountUniqueWords(Ptr textPtr,
unsigned short byteCount)
{
Ptr    endPnt,wordStartPtr;
register char   *charPnt;
register long   hash;
long   count;
register short  wordLength;
unsigned short  totalWords = 0;
short  i,cmp;
WordTablePtr    *hashTable;
WordTablePtr    wordTable;
WordTablePtr    last,wordTableEntry;
char   charTypeTable[256];
long   *zeroTblPtr;
//total possable number of words = 16556
//assuming a maximum size buffer of text
//I will use a hash table size of 1024

count = 4L * kHashSize;
//array of (NULL)Ptr’s
hashTable = (WordTablePtr *) NewPtrClear(count);
if (hashTable == 0L)
while (TRUE)
SysBeep(10); //not enough memory

count = 16556L * sizeof(WordTableRec);
wordTable = (WordTablePtr) NewPtr(count);
if (wordTable == 0L)
while (TRUE)
SysBeep(10); //not enough memory

//zero out the ‘charTypeTable’
zeroTblPtr = (long *) &charTypeTable;
for (i=0; i<64; i++)
*zeroTblPtr++ = 0;

//init lookup table used for uppercasing and
//identifying non letter characters
for (i=0;i<26; i++)
charTypeTable[i+(Byte) ‘A’] =
charTypeTable[i+(Byte) ‘a’] =
(char) (i+((Byte) ‘A’));

totalWords = 0;
charPnt = textPtr;
endPnt = textPtr + byteCount;
while (charPnt < endPnt) {
//skip spaces
while (charPnt < endPnt &&
charTypeTable[*charPnt] == 0)
charPnt++;
//pointer to begining of new word
wordStartPtr = charPnt;
hash = 0;
if (endPnt-charPnt > 255) {
//at least 255 characters left
//advance to the end of the word
//we can assume that a word is <=255 characters long
//uppercasing the text
//and doing a hash function
while (*charPnt = charTypeTable[*charPnt])
hash = (hash << 4)  + *charPnt++ -
‘A’ + (hash >> 10);
}
else {
while (charPnt < endPnt &&
(*charPnt = charTypeTable[*charPnt]))
hash = (hash << 4) + *charPnt++ - ‘A’ + (hash >> 10);
}
wordLength = charPnt-wordStartPtr;

last = NULL;
//this hash entry has not been used yet
wordTableEntry = &wordTable[totalWords++];
hashTable[hash] = wordTableEntry;
wordTableEntry->length   = wordLength;
wordTableEntry->wordPtr  = wordStartPtr;
wordTableEntry->nextNode = 0;
}
else {
//the entries are ordered by word length
//find the first entry that is as long or longer
{
}
//no other entries as long as this one
wordTableEntry = &wordTable[totalWords++];
if (last == NULL)
hashTable[hash] = wordTableEntry;
else
last->nextNode = wordTableEntry;
wordTableEntry->length = wordLength;
wordTableEntry->wordPtr= wordStartPtr;
wordTableEntry->nextNode= NULL;
}
else if (linkPtr->length > wordLength) {
wordTableEntry = &wordTable[totalWords++];
if (last == NULL) {
wordTableEntry->nextNode = hashTable[hash];
hashTable[hash] = wordTableEntry;
}
else {
wordTableEntry->nextNode = last->nextNode;
last->nextNode = wordTableEntry;
}
wordTableEntry->length = wordLength;
wordTableEntry->wordPtr= wordStartPtr;
}
else {
//check entries with same word lengths
(cmp = stringCmp(wordLength, wordStartPtr,
}
//end of list and no match
wordTableEntry = &wordTable[totalWords++];
if (last == NULL)
hashTable[hash] = wordTableEntry;
else
last->nextNode = wordTableEntry;
wordTableEntry->length = wordLength;
wordTableEntry->wordPtr= wordStartPtr;
wordTableEntry->nextNode= 0;
}
else if (linkPtr->length > wordLength || cmp>0)
{
//insert word entry here
wordTableEntry = &wordTable[totalWords++];
if (last == NULL) { //hash table to point here
wordTableEntry->nextNode = hashTable[hash];
hashTable[hash] = wordTableEntry;
}
else {
wordTableEntry->nextNode= last->nextNode;
last->nextNode = wordTableEntry;
}
wordTableEntry->length  = wordLength;
wordTableEntry->wordPtr = wordStartPtr;
}
}
}
}

DisposePtr((Ptr) hashTable);
DisposePtr((Ptr) wordTable);

}
```

## The Rules

Here’s how it works: Each month there will be a different programming challenge presented here. First, you must write some code that solves the challenge. Second, you must optimize your code (a lot). Then, submit your solution to MacTech Magazine (formerly MacTutor). A winner will be chosen based on code correctness, speed, size and elegance (in that order of importance) as well as the postmark of the answer. In the event of multiple equally desirable solutions, one winner will be chosen at random (with honorable mention, but no prize, given to the runners up). The prize for the best solution each month is \$50 and a limited edition “The Winner! MacTech Magazine Programming Challenge” T-shirt (not to be found in stores).

In order to make fair comparisons between solutions, all solutions must be in ANSI compatible C (i.e., don’t use Think’s Object extensions). However, you may call any routine in the Macintosh toolbox you want (i.e., it doesn’t matter if you use NewPtr instead of malloc). All entries will be tested with the FPU and 68020 flags turned off in THINK C. When timing routines, the latest version of THINK C will be used (with ANSI Settings plus “Honor ‘register’ first” and “Use Global Optimizer” turned on) so beware if you optimize for a different C compiler.

The solution and winners for this month’s Programmers’ Challenge will be published in the issue two months later. All submissions must be received by the 10th day of the month printed on the front of this issue.

All solutions should be marked “Attn: Programmers’ Challenge Solution” and sent to Xplain Corporation (the publishers of MacTech Magazine) via “snail mail” or preferably, e-mail - AppleLink: MT.PROGCHAL, Internet: progchallenge@xplain.com, and CompuServe: 71552,174. If you send via snail mail, please include a disk with the solution and all related files (including contact information). See page 2 for information on “How to Contact Xplain Corporation.”

MacTech Magazine reserves the right to publish any solution entered in the Programming Challenge of the Month and all entries are the property of MacTech Magazine upon submission. The submission falls under all the same conventions of an article submission.

Community Search:
MacTech Search:

OmniOutliner Pro 4.2 - Pro version of th...
OmniOutliner Pro is a flexible program for creating, collecting, and organizing information. Give your creativity a kick start by using an application that's actually designed to help you think. It's... Read more
VLC Media Player 2.2.1 - Popular multime...
VLC Media Player is a highly portable multimedia player for various audio and video formats (MPEG-1, MPEG-2, MPEG-4, DivX, MP3, OGG, ...) as well as DVDs, VCDs, and various streaming protocols. It... Read more
Nisus Writer Pro 2.1.1 - Multilingual wo...
Nisus Writer Pro is a powerful multilingual word processor, similar to its entry level products, but brings new features such as table of contents, indexing, bookmarks, widow and orphan control,... Read more
Tinderbox 6.2.0 - Store and organize you...
Tinderbox is a personal content management assistant. It stores your notes, ideas, and plans. It can help you organize and understand them. And Tinderbox helps you share ideas through Web journals... Read more
OmniOutliner 4.2 - Organize your ideas,...
OmniOutliner is a flexible program for creating, collecting, and organizing information. Give your creativity a kick start by using an application that's actually designed to help you think. It's... Read more
Things 2.5.4 - Elegant personal task man...
Things is a task management solution that helps to organize your tasks in an elegant and intuitive way. Things combines powerful features with simplicity through the use of tags and its intelligent... Read more
NeoOffice 2014.10 - Mac-tailored, OpenOf...
NeoOffice is a complete office suite for OS X. With NeoOffice, users can view, edit, and save OpenOffice documents, PDF files, and most Microsoft Word, Excel, and PowerPoint documents. NeoOffice 3.x... Read more
iPhoto Library Manager 4.2 - Manage mult...
iPhoto Library Manager allows you to organize your photos among multiple iPhoto libraries, rather than having to store all of your photos in one giant library. You can browse the photos in all your... Read more
Web Snapper 3.3.8 - Capture entire Web p...
Web Snapper lets you capture Web pages exactly as they appear in your browser. You can send them to a file as images or vector-based, multi-page PDFs. It captures the whole Web page - eliminating the... Read more
TeamViewer 10.0.41404 - Establish remote...
TeamViewer gives you remote control of any computer or Mac over the Internet within seconds, or can be used for online meetings. Find out why more than 200 million users trust TeamViewer! Free for... Read more

## Latest Forum Discussions

Chainsaw Warrior: Lords of the Night has...
It's time to put the Darkness back in its place now that Chainsaw Warrior: Lords of the Night has officially made it to iOS. | Read more »
A World of Ice and Fire Lets You Stalk 2...
George R. R. Martin’s A World of Ice and Fire, by Random House, is a mobile guide to the epic series. The new update gives you the Journeys map feture that will let you track the movements of 25 different characters. But don't worry, you can protect... | Read more »
Gameloft Announces Battle Odyssey, a New...
Battle Odyssey, Gameloft's newest puzzle RPG, is coming to the App Store next week. Set in the world of Pondera, you will need to control the power of the elements to defend the world from evil. You'll be able to entlist over 500 allies to aid you... | Read more »
Fusion - HDR Camera (Photography)
Fusion - HDR Camera 1.0.0 Device: iOS Universal Category: Photography Price: \$1.99, Version: 1.0.0 (iTunes) Description: Fusion creates HDR (high dynamic range) photos by capturing different exposures and then combining them into one... | Read more »
Sago Mini Toolbox (Education)
Sago Mini Toolbox 1.1 Device: iOS Universal Category: Education Price: \$2.99, Version: 1.1 (iTunes) Description: Come build with the Sago Mini friends! Use a wrench, try a saw, or hammer some nails. From sewing hand puppets to... | Read more »
You Should Probably Grab Hitman GO While...
Hitman GO is a surprisingly cool (yet also incredibly drastic) departure from the Hitman series. It's well worth playing for any puzzle game fans out there, and at the moment you can get your hands - or garrotte if you will - on it for a mere \$0.99... | Read more »
IFTTT is Bringing Do Button and Do Note...
IFTTT has announced Do Button and Do Note for the Apple Watch. Do Button lets you make your own personalized button that can connect to things like your Google Drive, control the temperature in your home with Nest Thermostat, or turn the lights on... | Read more »
How Many Days, Hours, and Minutes Are Le...
Countdown, by Yves Tscherry, is now available on the App Store. The app keeps track of countdowns to your favorite things such as someones birthday or days till the New Year. You can display the time in seconds, minutes, hours, days, weeks, months,... | Read more »
The All-New Misfit 2.0 App is Available...
Misfit has just given their app a complete overhaul. Misfit 2.0 now has a brand new interface with a sleek design and is easier to navigate. You'll be able to sync your Misfit device and look up health and fitness information faster than ever before... | Read more »
Halo: Spartan Strike (Games)
Halo: Spartan Strike 1.0 Device: iOS Universal Category: Games Price: \$5.99, Version: 1.0 (iTunes) Description: Delve into 30 challenging missions through cities and jungles using a devastating arsenal of weapons, abilities and... | Read more »

## Price Scanner via MacPrices.net

TigerText Introduces First Secure Enterprise...
TigerText, a provider of secure, real-time messaging for the enterprise, has announced the launch of TigerText for the Apple Watch. TigerText for the Apple Watch enables users to securely send and... Read more
The Conservation Fund Partners with Apple To...
The Conservation Fund has announced that it will partner with Apple to help protect working forests in the United States. The Apple initiative will conserve more than 36,000 acres of working... Read more
Clearance 13-inch 2.6GHz Retina MacBook Pro a...
B&H Photo has clearance 2014 13″ 2.6GHz/128GB Retina MacBook Pros now available for \$1099, or \$200 off original MSRP. Shipping is free, and B&H charges NY sales tax only. Read more
Apple refurbished 2014 13-inch Retina MacBook...
The Apple Store has Apple Certified Refurbished 2014 13″ Retina MacBook Pros available for up to \$400 off original MSRP, starting at \$979. An Apple one-year warranty is included with each model, and... Read more
iMacs on sale for up to \$205 off MSRP, NY tax...
B&H Photo has 21″ and 27″ iMacs on sale for up to \$205 off MSRP including free shipping plus NY sales tax only: - 21″ 1.4GHz iMac: \$1019 \$80 off - 21″ 2.7GHz iMac: \$1189 \$110 off - 21″ 2.9GHz... Read more
Sale! 16GB iPhone 5S for \$1 with service
Best Buy is offering 16GB iPhone 5Ss for \$1.00 with 2-year activation at a participating cellular provider. Choose free home shipping and activation, or buy online and activate during in-store pickup... Read more
Apple refurbished 2014 MacBook Airs available...
The Apple Store has Apple Certified Refurbished 2014 MacBook Airs available starting at \$679. An Apple one-year warranty is included with each MacBook, and shipping is free. These are currently the... Read more
27-inch 3.5GHz 5K iMac on sale for \$2349, sav...
Adorama has the 27″ 3.5GHz 5K iMac in stock today and on sale for \$2349 including free shipping plus NY & NJ sales tax only. Their price is \$150 off MSRP. For a limited time, Adorama will... Read more
Save up to \$380 on an iMac with Apple refurbi...
The Apple Store has Apple Certified Refurbished iMacs available for up to \$380 off the cost of new models. Apple’s one-year warranty is standard, and shipping is free: - 27″ 3.5GHz 5K iMac – \$2119 \$... Read more
iFixIt Teardown Awards 12-IInch Retina MacBoo...
iFixIt has posted its illustrated teardown of the new 12-inch MacBook Retina. They note that this new MacBook is less than half the thickness of the last Apple notebook called just “MacBook” back in... Read more

## Jobs Board

*Apple* Watch SW Application Project Manager...
**Job Summary** The Apple Watch software team is looking for an Application Engineering Project Manager to work on new projects for Apple . The successful candidate Read more
*Apple* Solutions Consultant - Retail Sales...
**Job Summary** As an Apple Solutions Consultant (ASC) you are the link between our customers and our products. Your role is to drive the Apple business in a retail Read more
*Apple* Retail - Multiple Positions (US) - A...
Sales Specialist - Retail Customer Service and Sales Transform Apple Store visitors into loyal Apple customers. When customers enter the store, you're also the Read more
Technical Project Manager - *Apple* Pay - A...
**Job Summary** Apple Pay is seeking an experienced technical PM to…manage the on boarding of new merchants for the Apple Pay platform in the US Within this role you Read more
Senior Identity Architect - *Apple* Pay - A...
**Job Summary** Apple , Inc. is looking for a highly motivated, innovative and hands-on senior identity architect to join the Apple Pay Engineering team. You will Read more