Author: Luca Zanini
-
ìNames scores
From the Project Euler Problem 22: Using […] a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working out the alphabetical value for each name, multiply this value by its alphabetical position in the list to obtain a name score. For example, when the list is sorted…
-
The Form Table and Form Layout Row controls of the Extension Library
The Form Table and Form Layout Row controls allow you to easily implement a form with the fields and their labels. In this post I use these two controls to convert the form “Document” to xpage in a database that inherits from the template Doc Library – Notes & web (8.5).
-
Amicable numbers
From the Project Euler Problem 21: Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called…
-
Factorial digit sum
From the Project Euler Problem 20: n! means n * (n – 1) * … * 3 * 2 * 1 For example, 10! = 10 * 9 … * 3 * 2 * 1 = 3628800, and the sum of the digits in the number 10! is 3 + 6 + 2 + 8…
-
The Exception Unable to instantiate activity ComponentInfo
If you have this error “Unable to instantiate activity ComponentInfo” in the LogCat of Android just you launch your app, first you have to check the file AndroidManifest.xml especially the code lines package=”[your package]” it is an attribute of the tag manifest and you insert a unique name for your app in java package style,…
-
Counting Sundays
From the Project Euler Problem 19: You are given the following information, but you may prefer to do some research for yourself. 1 Jan 1900 was a Monday. Thirty days has September, April, June and November. All the rest have thirty-one, Saving February alone, Which has twenty-eight, rain or shine. And on leap years, twenty-nine.…
-
Maximum path sum
From the Project Euler Problem 18: By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23. 3 7 4 2 4 6 8 5 9 3 That is, 3 + 7 + 4 + 9 = 23. Find…
-
Number letter counts
From the Project Euler Problem 17: If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total. If all the numbers from 1 to 1000 (one thousand) inclusive were written out in…
-
Hidden fields in a lotus form open with a browser
In a lotus form you can hide the fields enabling the check box “Hide paragraph from Web browser” in the window of the properties of the field but in this way the field is not generated as a hidden field, i.e. a html tag input with attribute type=”hidden” is not generated and you can’t access…