Blog

Here’s the problem: How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)? And here’s my code: #include <stdio.h> int main(void){ int months[12] = { 31 , 28 , 31 , 30 , 31 , 30 , 31 , 31 , 30 , 31Read more

def euler122(): out=[[1,2]] out2=[1,2] count=0 flag=True while flag: print len(out) print “-“*59 for i in out: for j in [x+y for x in i for y in i]: if i+[j] not in out and sorted(list(set(i+[j])))==i+[j] and j not in out2: if count%100==0: print len([p for p in list(set(out2)) if p<201]) out.append(i+[j]) out2.append(j) count+=1 if len([pRead more

I wanted to practice functional programming (fp) without using any library but using vanilla JS only. So I took a problem from project euler: The sum of the squares of the first ten natural numbers is, 12 + 22 + … + 102 = 385 The square of the sum of the first ten naturalRead more

I wanted to practice functional programming (fp) without using any library but pure using vanilla JS only. So I took the 4th problem from project euler: A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99. Find the largest palindromeRead more

I’m new to Haskell, the part of my code I’m concerned with is the isSumAbundant function. Surely there must be a better way, in an imperative language I might use a for loop and break out of the loop if i got greater than n, but it seems like having to filter the list forRead more

Here is a summary of the problem: “A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before… How many starting numbers below ten million will arrive at 89?” The site also gives an example at https://projecteuler.net/problem=92. I haveRead more

The things I’m interested the most from the review are: The performance of the code Overall review of the code structure, styling rules and naming conventions. By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms. import math import itertools #———————————————————————————- def calc_fibonacci_num(n):Read more

How can I optimize and make prettier the following code? Main.cpp #include “UtilitiesP.h” #include “Simpson.h” int main(void) { double agm(1/functionsP::agm(1, 2)); double integral( (2/constantsP::kPi) * Simpson(0, constantsP::kPi*0.5, constantsP::kEps, functionsP::eliptic)); assert(fabs(agm-integral)<constantsP::kEps); double firstVal(constantsP::kPi*0.5); integral = Simpson(constantsP::kAlmostZero, 10000, constantsP::kEps, functionsP::Dirichlet); std::cout << firstVal << std::endl; std::cout << integral << std::endl; double secondVal(sqrt(constantsP::kPi)*0.5); integral = Simpson(constantsP::kAlmostZero, 12, constantsP::kEps,Read more