# Category: Algorithm

• ## Example for an Array with processing language

/** * Array. * * An array is a list of data. Each piece of data in an array * is identified by an index number representing its position in * the array. Arrays are zero based, which means that the first * element in the array is [0], the second element is [1], and […]

• ## A program to solve project euler problem 11

[python] # This program is copied from http://code.jasonbhill.com/python/project-euler-problem-11/ # Largest product in a grid # https://projecteuler.net/problem=11 import time start = time.time() L = [] L.append("08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08") L.append("49 49 99 40 17 81 18 57 60 87 17 […]

• ## How to write a program to solve project euler problem 10 ?

// Louis Casillas, oxaric@gmail.com // Further Edits: Fahad Uddin // Modified a little by Jeffrin Jose T // Euler Problem #10 // Find the sum of all the primes below two million. #include #include char isPrime( int num ) { if ((num % 3) == 0 ) { return 0; } int i = 0; […]

• ## How to write a program to solve project euler problem 9 ?

# There exists exactly one Pythagorean triplet for which a + b + c = 1000. # Find the product abc. # This program is copied from http://code.jasonbhill.com/python/project-euler-problem-9/ import time def prod_triplet_w_sum(n): for i in range(1,n,1): for j in range(1,n-i,1): k = n-i-j if i**2+j**2==k**2: return i*j*k return 0 start = time.time() product = prod_triplet_w_sum(1000) […]

• ## How to write a program to solve related to euler problem 8 ?

# This code related is taken from http://code.jasonbhill.com/python/project-euler-problem-8/ import time start = time.time() L = [] L.append(“73167176531330624919225119674426574742355349194934”) L.append(“96983520312774506326239578318016984801869478851843”) L.append(“85861560789112949495459501737958331952853208805511”) L.append(“12540698747158523863050715693290963295227443043557”) L.append(“66896648950445244523161731856403098711121722383113”) L.append(“62229893423380308135336276614282806444486645238749”) L.append(“30358907296290491560440772390713810515859307960866”) L.append(“70172427121883998797908792274921901699720888093776”) L.append(“65727333001053367881220235421809751254540594752243”) L.append(“52584907711670556013604839586446706324415722155397”) L.append(“53697817977846174064955149290862569321978468622482”) L.append(“83972241375657056057490261407972968652414535100474”) L.append(“82166370484403199890008895243450658541227588666881”) L.append(“16427171479924442928230863465674813919123162824586”) L.append(“17866458359124566529476545682848912883142607690042”) L.append(“24219022671055626321111109370544217506941658960408”) L.append(“07198403850962455444362981230987879927244284909188”) L.append(“84580156166097919133875499200524063689912560717606”) L.append(“05886116467109405077541002256983155200055935729725”) L.append(“71636269561882670428252483600823257530420752963450”) M = [] for s in L: for t in list(s): M.append(t) prod = 0 for i in range(len(M)-4): […]

• ## A program to find 10001st prime number ?

ABOUT PRIME NUMBER A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a […]

• ## How to write a program to solve project euler problem 6 ?

/* * Project Name: Problem Six * Solution Name: Problem Six * Original creation date: 06/07/2011 * Edit date: 18/01/2013 * Programmer name: Jamie Taylor (aka “GaProgMan”) * File name: ProblemSix.c * * Purpose of this project: * Problem Six, from Project Euler. * URL: http://projecteuler.net/index.php?section=problems&id=6 * The sum of the squares of the first […]

• ## How to write a program to solve project euler problem 5 ?

/* This file is worked ( mostly copy and paste ) from from http://www.programminglogic.com/solution-to-project-euler-5/ Notice that if the number is evenly divisible by all numbers from 11 to 20 it’s also divisible by all numbers from 2 to 10. */ #include <stdio.h> int main(){ int i,j,counter; for (i=10;i<1000000000;i++){ counter=0; for (j=11;j<21;j++){ if (i%j==0) counter++; } […]

• ## How to write a program to solve project Euler problem 4

”’ This file is worked on from http://www.s-anand.net/euler.html , Solution of Problem 4 A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 x 99. Find the largest palindrome made from the product of two 3-digit numbers. ”’ n = 0 for […]