Comments on: Project Euler in F# – Problem 22

By: Vikesh

Vikesh — Sun, 12 Dec 2010 19:49:28 +0000

Here is my solution…. not pretty efficient but it completes in 29-32ms on my System. (Java)

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
*
* @author Vikesh
*/
public class Problem22 {

static List names = new ArrayList();

public static void main(String[] args) throws IOException {
long start = System.currentTimeMillis();
File file = new File(System.getProperty(”user.home”), “names.txt”);
String firstName = null;
try {
BufferedReader bf = new BufferedReader(new FileReader(file));
firstName = bf.readLine();
} catch (FileNotFoundException ex) {
Logger.getLogger(Problem22.class.getName()).log(Level.SEVERE, null, ex);
}
Collections.sort(names);
String[] tokens = firstName.split(”,”);
for (String s : tokens) {
names.add(s.substring(1, s.length() – 1));
}
Collections.sort(names);
int count = 0;
long nameRank = 0;
long score = 0;
for (String name : names) {
++count;
int nameSum = 0;
for(int i = 0 ; i< name.length();++i){
nameSum+= (int)name.charAt(i) – 64;
nameRank = nameSum*(count);
}
score+= nameRank;
}

System.out.println("Total Count: "+ score);
long end = System.currentTimeMillis();
System.out.println("Time: "+(end-start));
}
}

By: Bob Roberts

Bob Roberts — Thu, 13 Nov 2008 15:32:27 +0000

You don’t need to remove the quotes to sort the list. The list will sort correctly with the quote. When you add the value of the names, you can just ignore quotes when adding values.

By: Michiel Borkent

Michiel Borkent — Mon, 03 Mar 2008 02:40:18 +0000

Here is another solution using List.mapi:

#light
open System.IO
let answer2 =
let names = File.ReadAllText(@”C:\dev\Chapter4\names.txt”).Split([|','|]) |> Seq.map (fun x -> x.Replace(”\”", “”))
let sortednames = names |> Seq.to_list |> List.sort compare
let CharVal x = 1 + Char.code x – Char.code ‘A’
let Score i x =
(i+1) * (Seq.map CharVal x |> Seq.fold1 (+))
List.mapi Score sortednames |> Seq.fold1 (+)