{"id":4545,"date":"2021-01-08T00:01:49","date_gmt":"2021-01-08T08:01:49","guid":{"rendered":"https:\/\/c-for-dummies.com\/blog\/?p=4545"},"modified":"2021-01-08T09:02:48","modified_gmt":"2021-01-08T17:02:48","slug":"find-the-most-factors-solution","status":"publish","type":"post","link":"https:\/\/c-for-dummies.com\/blog\/?p=4545","title":{"rendered":"Find the Most Factors – Solution"},"content":{"rendered":"

The challenge for this month’s Exercise<\/a> is to discover those values in the range 1 to 999 that have the highest number of factors. Never mind the math! Let C and the computer do the work for you.
\n
\nI devised a solution in three parts:<\/p>\n

First, determine the factors of values from 1 through 999. This loop was borrowed from my earlier prime number example<\/a>. The big difference is that the factors for each value is stored in an array, factors[]<\/code>:<\/p>\n

factors[v]++;<\/code><\/p>\n

Variable v<\/code> represents the value examined, which is tied to an element in the factors[]<\/code> array. This approach makes sense when you study the earlier code example.<\/p>\n

Second, I find the maximum (largest) value in the factors[]<\/code> array. This part of the code uses a find-the-maximum-value algorithm. Further, I’m interested only in the value, not the element number. The value is saved in variable max<\/code>.<\/p>\n

Third and finally, a loop plows through all elements in the factors[]<\/code> array to see which match the max<\/code> value. This way, should multiple values have the same number of factors, all are output.<\/p>\n

Here’s my solution:<\/p>\n

2020_01-Exercise.c<\/a><\/h3>\n
\r\n#include <stdio.h>\r\n\r\n#define SIZE 1000\r\n\r\nint main()\r\n{\r\n    int factors[SIZE];\r\n    int v,x,max;\r\n\r\n    \/* determine the factors *\/<\/span>\r\n    v = 1;\r\n    while(v<SIZE)\r\n    {\r\n        factors[v] = 1;\r\n        for( x=1; x<v; x++ )\r\n        {\r\n            if( v%x == 0 )\r\n            {\r\n                factors[v]++;\r\n            }\r\n        }\r\n        v++;\r\n    }\r\n\r\n    \/* obtain the greatest factor *\/<\/span>\r\n    max = 0;\r\n    for( x=1; x<SIZE; x++ )\r\n    {\r\n        if( factors[x]>max )\r\n            max = factors[x];\r\n    }\r\n\r\n    \/* Show the highest factors *\/<\/span>\r\n    \/* This also accounts for multiple values *\/<\/span>\r\n    for( x=1; x<SIZE; x++ )\r\n    {\r\n        if( factors[x]==max )\r\n            printf(\"%d has %d factors\\n\",x,max);\r\n    }\r\n\r\n    return(0);\r\n}<\/pre>\n
The highest number of factors is determined by running the code. The winner is:<\/p>\n
840 has 32 factors<\/code><\/p>\n
Impressive — and not what I expected, but it checks out. I figured multiple values would have a high number of factors, but the winner is 840.<\/p>\n
The code can be improved upon, naturally. If I knew maths better than I do, I’m sure some algorithms or rules exist for eliminating some numbers as impossible factors. Pulling them out of the factor loop could optimize the code. Other approaches exist to solve the problem, which is true of all programming.<\/p>\n
If your solution worked and yielded the same result, great! I find programming exercises fun not only to work out a problem (and the solution may come in handy later), but also to discover the multiple ways that a single task can be implemented.<\/p>\n","protected":false},"excerpt":{"rendered":"
The challenge for this month’s Exercise is to discover those values in the range 1 to 999 that have the highest number of factors. Never mind the math! Let C and the computer do the work for you.<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[5],"tags":[],"class_list":["post-4545","post","type-post","status-publish","format-standard","hentry","category-solution"],"_links":{"self":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/4545","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=4545"}],"version-history":[{"count":5,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/4545\/revisions"}],"predecessor-version":[{"id":4573,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=\/wp\/v2\/posts\/4545\/revisions\/4573"}],"wp:attachment":[{"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=4545"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=4545"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/c-for-dummies.com\/blog\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=4545"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}