原创 Project Eurler - Problem 1

If we list all the natural numbers below 10 that are multiples of 3 or 5,

原创 Project Euler - Problem 4

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9

原创 Project Euler - Problem 6

The sum of the squares of the first ten natural numbers is, 12 + 22 + … + 102 = 385 The square of the sum of the first

原创 Project Euler - Problem 3

The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime

原创 Project Euler - Problem 5

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder. What is the

原创 Project Euler - Problem 2

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the fi

原创 Project Eurler - Problem 7

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13. What is the 10001s

原创 C# 處理圖片

今天的工作是把服務器上所有的電影封面圖片稍微裁剪,適當縮放。貼下查資料和自己用到的代碼~~ 用到的一個枚舉 enum AnchorPosition { Top, Center, Bottom, Left

原创 Project Euler – Problem 16

215 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 21000? 用py

原创 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.

原创 c# 提取HTML中所有圖片URL

/// <summary> /// 取得HTML中所有圖片的 URL。 /// </summary> /// <param name="sHtmlText">HTML代

原创 Project Euler – Problem 10

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the primes below two million. 計算2000000一下的素數和

原创 Project Euler – Problem 12

The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2

原创 Project Euler – Problem 23

A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the

原创 Project Euler – Problem 22

Using names.txt (right click and 'Save Link/Target As...'), a 46K text file containing over five-thousand first names,