TweetFollow Us on Twitter

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.

MAGIC ADDITIONS

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 kHashMask0x003FF
#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;
 register WordTablePtr  linkPtr;
 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;

 hash &= kHashMask;
 linkPtr = (WordTablePtr) hashTable[hash];
 
 last = NULL;
 if (linkPtr==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
 while (linkPtr != NULL && linkPtr->length < wordLength)
 {
 last = linkPtr;
 linkPtr = linkPtr->nextNode;
 }
 if (linkPtr == NULL) {
 //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) {
 //insert betean ‘last’ and ‘linkPtr’
 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
 while (linkPtr != NULL &&
   linkPtr->length == wordLength &&
   (cmp = stringCmp(wordLength, wordStartPtr,
   linkPtr->wordPtr)) <0) {
 last = linkPtr;
 linkPtr = linkPtr->nextNode;
 }
 if (linkPtr == NULL) {
 //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);
 
 return totalWords;
}

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:

Software Updates via MacUpdate

TotalFinder 1.12.2 - Adds tabs, hotkeys,...
TotalFinder is a universally acclaimed navigational companion for your Mac. Enhance your Mac's Finder with features so smart and convenient, you won't believe you ever lived without them. Features... Read more
Duet 2.3.0.3 - Use your iPad as an exter...
Duet is the first app that allows you to use your iDevice as an extra display for your Mac using the Lightning or 30-pin cable. Note: This app requires a $9.99 iOS companion app. Version 2.3.0.3:... Read more
FileMaker Pro Advanced 18.0.3 - Powerful...
FileMaker Pro Advanced is the tool you use to create a custom app. You also use FileMaker Pro Advanced to access your app on a computer. Start by importing data from a spreadsheet or using a built-in... Read more
OsiriX Lite 10.0.6 - 3D medical image pr...
OsiriX Lite is an image processing software dedicated to DICOM images (".dcm" / ".DCM" extension) produced by medical equipment (MRI, CT, PET, PET-CT, ...) and confocal microscopy (LSM and BioRAD-PIC... Read more
Ableton Live 10.1.5 - Record music using...
Ableton Live lets you create and record music on your Mac. Use digital instruments, pre-recorded sounds, and sampled loops to arrange, produce, and perform your music like never before. Ableton Live... Read more
Burn 2.7.8 - Easily burn data, audio, vi...
Burn... There are a lot of ways to approach burning discs. Burn keeps it simple, but still offers a lot of advanced options. Create data discs with advanced data settings like, file permissions, the... Read more
Malwarebytes 4.0.30.3073 - Adware remova...
Malwarebytes (was AdwareMedic) helps you get your Mac experience back. Malwarebytes scans for and removes code that degrades system performance or attacks your system. Making your Mac once again your... Read more
Acorn 6.5.3 - Bitmap image editor.
Acorn is a new image editor built with one goal in mind - simplicity. Fast, easy, and fluid, Acorn provides the options you'll need without any overhead. Acorn feels right, and won't drain your bank... Read more
Fantastical 2.5.13 - Create calendar eve...
Fantastical is the Mac calendar you'll actually enjoy using. Creating an event with Fantastical is quick, easy, and fun: Open Fantastical with a single click or keystroke Type in your event... Read more
A Better Finder Rename 11.05 - File, pho...
A Better Finder Rename is the most complete renaming solution available on the market today. That's why, since 1996, tens of thousands of hobbyists, professionals and businesses depend on A Better... Read more

Latest Forum Discussions

See All

Eternal Warfare is a new idle clicker fo...
Idle games are a popular genre on mobile, they might not be to everyone's taste but they're made with such regularity and receive a lot of downloads, so it's hard to argue it's not big business. Eternal Warfare is set to join the sea of idle games... | Read more »
New heroes and balance updates set to ar...
It feels like Hearthstone: Battlegrounds only launched yesterday, and already the auto batter addition to Blizzard's megahit card game is set to receive new heroes and balance updates. [Read more] | Read more »
Pre-register for Hello Kitty AR: Kawaii...
Hello Kitty — the cute cat that launched a multi-billion-pound franchise — has been brought to life… sort of. Sanrio has teamed up with the Bublar Group to create a new mobile game that uses AR tech to turn the real world into Hello Kitty’s... | Read more »
Gorgeous and tranquil puzzler Spring Fal...
One-man indie studio SPARSE//GameDev has now launched its tranquil puzzler, Spring Falls. It's described as "a peaceful puzzle game about water, erosion, and watching things grow". [Read more] | Read more »
Black Desert Mobile gets an official rel...
Pearl Abyss has just announced that its highly-anticipated MMO, Black Desert Mobile, will launch globally for iOS and Android on December 11th. [Read more] | Read more »
Another Eden receives new a episode, cha...
Another Eden, WFS' popular RPG, has received another update that brings new story content to the game alongside a few new heroes to discover. [Read more] | Read more »
Overdox guide - Tips and tricks for begi...
Overdox is a clever battle royale that changes things up by adding MOBA mechanics and melee combat to the mix. This new hybrid game can be quite a bit to take in at first, so we’ve put together a list of tips to help you get a leg up on the... | Read more »
Roterra Extreme - Great Escape is a pers...
Roterra Extreme – Great Escape has been described by developers Dig-It Games as a mini-sequel to their acclaimed title Roterra: Flip the Fairytale. It continues that game's tradition of messing with which way is up, tasking you with solving... | Read more »
Hearthstone: Battlegrounds open beta lau...
Remember earlier this year when auto battlers were the latest hotness? We had Auto Chess, DOTA Underlords, Chess Rush, and more all gunning for our attention. They all had their own reasons to play, but, at least from where I'm standing, most... | Read more »
The House of Da Vinci 2 gets a new gamep...
The House of Da Vinci launched all the way back in 2017. Now, developer Blue Brain Games is gearing up to deliver a second dose of The Room-inspired puzzling. Some fresh details have now emerged, alongside the game's first official trailer. [Read... | Read more »

Price Scanner via MacPrices.net

B&H offers $100 discounts on 4-Core and 6...
B&H Photo has new 4-Core and 6-Core Mac minis in stock and on sale today for $100 off Apple’s MSRP. Prices start at $699. Overnight shipping is free to many addresses in the US: – 3.6GHz Quad-... Read more
Save $200 today on a 2019 13″ MacBook Air wit...
Apple has a full line of Certified Refurbished 2019 13″ MacBook Airs available starting at only $929 and up to $200 off the cost of new Airs. Each MacBook features a new outer case, comes with a... Read more
New Verizon Pre-Black Friday 2019 deal: Buy o...
Buy one new Apple iPhone 11 model or 2018 iPhone XS model at Verizon and get a second one for free. One new line of service required. Offer is valid from November 21, 2019 to November 27, 2019. Here... Read more
AirPods with Wireless Charging Case on sale t...
Abt Electronics has 2019 AirPods with the Wireless Charging Case on sale today for $163 shipped. Their price is $36 off Apple’s MSRP, and it’s currently the cheapest price for these AirPods from any... Read more
Apple continues to offer 2017 13″ Dual-Core n...
Apple has Certified Refurbished 2017 13″ 2.3GHz Dual-Core non-Touch Bar MacBook Pros still available starting at $1019. An standard Apple one-year warranty is included with each model, outer cases... Read more
Save up to $120 on the new 16″ MacBook Pro at...
Apple’s resellers are starting to receive stock of new 16″ MacBook Pros, and the first set of sales & deals are now available: (1) Amazon 16″ MacBook Pros start on sale for $100-$116 off Apple’s... Read more
Apple Watch Series 3 models on sale at Amazon...
Amazon has Apple Watch Series 3 GPS models on sale for $30 off MSRP, starting at only $169. There prices are the lowest we’ve ever seen for these models from any Apple reseller. Choose Amazon as the... Read more
The ‘Mac Potpourri’ Mailbag: Edition #1- Info...
COMMENTARY: 11.20.19- Welcome to the inaugural edition of the “Mac Potpourri” Mailbag where we take a look at correspondence received from readers of this column from all over the world who write in... Read more
13″ 2.4GHz MacBook Pros available for up to $...
Apple has a full line of Certified Refurbished 2019 13″ 2.4GHz 4-Core Touch Bar MacBook Pros available starting at $1529 and up to $300 off MSRP. Apple’s one-year warranty is included, shipping is... Read more
New at T-Mobile: Switch to T-Mobile, and get...
T-Mobile is offering a free 64GB iPhone 8 for new customers who switch to T-Mobile and open a new line of service. Eligible trade-in required, and discount applied over a 24 month period. The fine... Read more

Jobs Board

Best Buy *Apple* Computing Master - Best Bu...
**747303BR** **Job Title:** Best Buy Apple Computing Master **Job Category:** Sales **Store NUmber or Department:** 001413-Cypress-Store **Job Description:** **What Read more
*Apple* Mobility Pro - Best Buy (United Stat...
**743221BR** **Job Title:** Apple Mobility Pro **Job Category:** Store Associates **Store NUmber or Department:** 000230-Greenwood-Store **Job Description:** At Best Read more
*Apple* Mobility Pro - Best Buy (United Stat...
**747338BR** **Job Title:** Apple Mobility Pro **Job Category:** Store Associates **Store NUmber or Department:** 000254-Superstition Springs-Store **Job Read more
Best Buy *Apple* Computing Master - Best Bu...
**745516BR** **Job Title:** Best Buy Apple Computing Master **Job Category:** Store Associates **Store NUmber or Department:** 001101-Manhattan-Store **Job Read more
Best Buy *Apple* Computing Master - Best Bu...
**746655BR** **Job Title:** Best Buy Apple Computing Master **Job Category:** Sales **Store NUmber or Department:** 002518-Atlantic Center-Store **Job Description:** Read more
All contents are Copyright 1984-2011 by Xplain Corporation. All rights reserved. Theme designed by Icreon.