IBM Ponder This Jan'22: Backtracking, Miller-Rabin and Caches

-
IBM Ponder This challenges take place once a month. It has been going on for many years. Most of the challenges, IMO, are really hard and I can't solve them. Every month I do take a look to see if it is solvable, and last month was a doable challenge.

Since I caught covid last month, and it hit me really hard, I stayed in isolation for several days. During that time I decided to take a crack at this problem. The problem is listed down below.

The way that I approached the problem was the following:
1/ Brute-force. Using backtracking to generate all the possible candidates. This is a standard Depth-First-Search (DFS) backtracking with search space pruning. It will take several minutes since there are just too many candidates. For the "*" bonus question, it does take several hours (~9h), so you need to run it overnight (standard average laptop)
2/ For the primarily testing, I'm a big fan of Miller-Rabin primality test: Miller–Rabin primality test - Wikipedia. The test is non-deterministic, it relies on the idea of using some "witness numbers" to "prove" that a certain number is prime. Although it is a non-deterministic model, the practical accuracy of this test approaches 100%, and its speed is incredible: ~LogN
3/ Even using Miller-Rabin primality test, since this test will be called millions of times, there is a need to cache the primes. The cache can be done inside the Miller-Rabin test itself.

With that, the execution time takes about ~20 minutes for the normal question, and ~9h for the bonus question. Code is here: IBMPonderThisJan2022/Program.cs at main · marcelodebarros/IBMPonderThisJan2022 (github.com)

Cheers, ACC



Forming primes in digit circles
The following riddle was suggested by Evert van Dijken.

Seven distinct digits are places on a circle. Then, numbers can be formed in the following manner: Choose one digit to start from and add it to the number, and then move a certain number of steps on the circle either clockwise or counterclockwise. Add the digit to the number, and keep this until five digits were chosen. These digits comprise the number (the first digit being the most significant digit).
For example, in the circle [4, 7, 3, 6, 2, 0, 1]:

One can start from "2", move 3 steps clockwise to "4", move one step counterclockwise to "1", move one more step counterclockwise to "0", and move 4 steps clockwise to "3", resulting in the number "24103".

Given a circle, we assign a score to each number that can be generated from the circle based on the minimum number of steps required to generate this number. In the example above, moving from "0" to "3" in 4 steps is not optimal; one can move just 3 steps by going counterclockwise. So the score of "24103" is 3+1+1+3=8.

We allow generation only of the numbers that satisfy all the following criterions:
1. Prime numbers.
2. All the digits are distinct.
3. No leading 0.

For a given circle, we can form all the numbers that satisfy the criterion and sum their scores.
For the circle [4, 7, 3, 6, 2, 0, 1] we will find 231 total primes with 5 distinct digits, giving us a total score of 1882. This 1882 is the score of the circle itself.

In our example we had n=7 digits in a circle and the numbers had d=5 digits but we can also generalize for different values of n,d (if n > 10 , we can use a different number base, but we won't do it here).

Your goal: Find circles giving the maximum and minimum score for the original n=7, d=5 setting.
Send your result in the following format:
[a1, a2, ..., an]
[b1, b2, ..., bn]

A bonus "*" will be given for finding circles giving the maximum and minimum score for n=8, d=6 .

Comments

Post a Comment

Popular posts from this blog

Advent of Code - Day 6, 2024: BFS and FSM

-
Image
To solve this Advent of Code (parts 1 and 2), I used Breadth-First Search (BFS) to keep moving the guard as well as Finite State Machine (FSM) to control the directions. This solves part 1 easily. Part 2 can be solved using the same technique, takes a little longer since you need to try every empty cell, but it eventually does the trick (takes a min or so). Code is down below, cheers, ACC. Day 6 - Advent of Code 2024 using System.IO; using System.Collections; using System; using System.Text; using System.Text.RegularExpressions; using System.ComponentModel.DataAnnotations; Process2(); void Process() { string fileName = "input.txt"; FileInfo fileInfo = new FileInfo(fileName); StreamReader sr = fileInfo.OpenText(); List map = new List (); int startRow = 0; int startCol = 0; while (!sr.EndOfStream) { string line = sr.ReadLine().Trim(); map.Add(new StringBuilder(line)); int indexStart = line.IndexOf('^'); ...
Read more

Golang vs. C#: performance characteristics (simple case study)

-
Image
This is an interesting example to study the performance characteristics of Golang compared to C# for a very particular case (not generalized though).  The same code was written in C# and Golang (literally translated from one to the other). Below you'll be able to see the source code for both. The problem is a simple post-order DFS in a tree-like graph. The code in C# times out (TLE = Time Limited Exceeded). The code in Golang not only works but beats 100% of the other Golang submissions. Take a look the image below: Some potential reasons for the performance gains from Go in this particular example are: 1. Language and Runtime Differences:    Go is compiled directly to machine code, while C# typically runs on a virtual machine (CLR).    Go has a simpler runtime with less overhead compared to the .NET runtime.    Go's garbage collector is designed for low latency, which can lead to better performance in some scenarios. 2. Data Structures:    G...
Read more

Advent of Code - Day 7, 2024: Backtracking and Eval

-
Image
Problem today requires backtracking and eval (evaluating a mathematical expression in the format of a string). Glad that it used a left-2-right evaluation, makes for an easy parsing and not overly complicated evaluation function. Code is down below for parts 1 and 2. Cheers, ACC. Day 7 - Advent of Code 2024 using System.IO; using System.Collections; using System; using System.Text; using System.Text.RegularExpressions; using System.ComponentModel.DataAnnotations; Process2(); void Process() { string fileName = "input.txt"; long retVal = 0; FileInfo fileInfo = new FileInfo(fileName); StreamReader sr = fileInfo.OpenText(); while (!sr.EndOfStream) { string line = sr.ReadLine().Trim(); string[] parts1 = line.Split(':'); long target = Int64.Parse(parts1[0]); string[] numbers = parts1[1].Split(new char[] { ' ' }, StringSplitOptions.RemoveEmptyEntries); if (TryAll1(numbers, target, "", 0)) r...
Read more