seen from United States
seen from United States
seen from United States
seen from Georgia
seen from Singapore
seen from United Kingdom
seen from T1
seen from Georgia
seen from China
seen from United Kingdom
seen from China
seen from T1
seen from United States
seen from Malaysia
seen from United States
seen from United States
seen from Australia
seen from China
seen from Netherlands
seen from United States
I'm having a lot of fun with these. So far they're quite a lot easier than Euler problems, being more code-based while Euler is "do math with the help of computers".
The only one that has presented me with any significant problems was day 7 but that was mostly due to problems parsing the input data rather than with logic. Day 9 was one where I pulled out a module I've used in Euler to simply brute-force all the combinations.
Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.
Free to watch • No registration required • HD streaming
Problem 9: Special Pythagorean Triplet
This was a easy problem as I solved by a naive approach. The link to solution is link
But on seeing the forum I found out a very good solution which converted this equation in three variable to 2 unknowns. a=2mn,b=m^2-n^2,c=m^2+n^2 hence a+b+c=1000 becomes 2mn+(m^2+n^2)+(m^2-n^2)=1000 m(m+n)=500, m=20 , n=5 and hence a,b and c can be obtained considering m>n
Problem 8: Largest product in a series
A very easy problem with complexity :O(13*len)
largeProd
Problem 7:10001st prime
A normal infinite loop to check whether a number is prime and maintain the count.
10001 prime
Problem 20: Factorial Digit Sum
Factorial of a long number and then sum of the digits.
factDigSum
Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.
Free to watch • No registration required • HD streaming
Problem 6: Sum Square Difference
This was a easy problem where the sum of square and sum of n terms can be applied to calculate the answer.
sumSquareDiff
Problem 4: Large Palindrome Product
In this problem, largest palindrome number that can be made by the product of two 3 digit number is to be obtained.
The complexity of the code is O(n2).
One optimization which I did is I ran the loop of j from i because when loop for i will run for say 999 then 999*999,999*998 and so on will be computed. If j runs from 999 instead of i then 998*999 will be recomputed which is useless.Â
The other trick was a good one. To check for palindrome I used sprintf to output the number in to a character array as it is sure that number will be a 6 digit number
LargePalinProd
Problem 3: Large Prime Factor
In this problem, a number was given and the task was to determine the largest prime number that divides it.
So I ran a loop from the square root of the number down to 0 and kept on checking for each divisor whether it is prime or not.
The code can be fount at:
LargePrimeFactor
