sytzz的专栏

#pragma once#include #include using namespace std;class MoonBigNum{public: MoonBigNum(void); MoonBigNum(const string &num); MoonBigNum(const UINT32 &num); MoonBigNum(const Moon

// Problem 42// 25 April 2003//// The nth term of the sequence of triangle numbers is given by, tn = ½n(n+1); so the first ten triangle numbers are://// 1, 3, 6, 10, 15, 21, 28, 36, 45, 55, ...

// Problem 38// 28 February 2003//// Take the number 192 and multiply it by each of 1, 2, and 3://// 192 1 = 192// 192 2 = 384// 192 3 = 576// By concatenating each product we get the 1 to

// 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 +

// Problem 37// 14 February 2003//// The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage

// Problem 36// 31 January 2003//// The decimal number, 585 = 10010010012 (binary), is palindromic in both bases.//// Find the sum of all numbers, less than one million, which are palindromic in

// Problem 34// 03 January 2003//// 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145.//// Find the sum of all numbers which are equal to the sum of the factorial of their digits.//

// Problem 33// 20 December 2002//// The fraction 49/98 is a curious fraction, as an inexperienced mathematician in attempting to simplify it may incorrectly believe that 49/98 = 4/8, which is corr

// Problem 32// 06 December 2002// // We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for example, the 5-digit number, 15234, is 1 through 5

// Problem 31// 22 November 2002//// In England the currency is made up of pound, O, and pence, p, and there are eight coins in general circulation://// 1p, 2p, 5p, 10p, 20p, 50p, O1 (100p) and O

// Problem 29// 25 October 2002//// Consider all integer combinations of ab for 2 a 5 and 2 b 5://// 22=4, 23=8, 24=16, 25=32// 32=9, 33=27, 34=81, 35=243// 42=16, 43=64, 44=256, 45=1024//

// Problem 28// 11 October 2002//// Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows://// 21 22 23 24 25// 20 7 8 9 10// 19 6

// Problem 27// 27 September 2002//// Euler published the remarkable quadratic formula://// n² + n + 41//// It turns out that the formula will produce 40 primes for the consecutive values n = 0

// Problem 41// 11 April 2003//// We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, 2143 is a 4-digit pandigital and is also pr

// Problem 40// 28 March 2003//// An irrational decimal fraction is created by concatenating the positive integers://// 0.123456789101112131415161718192021...//// It can be seen that the 12t

#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt

// Poker hands// Problem 54// In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way://// High Card: Highest value card.//

// Combinatoric selections// Problem 53// There are exactly ten ways of selecting three from five, 12345://// 123, 124, 125, 134, 135, 145, 234, 235, 245, and 345//// In combinatoric

#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt

#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt

#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt

#pragma once#include #include #include using namespace std;class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt

#pragma once#include class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt // Access: public

// Self powers// Problem 48// The series, 1^1 + 2^2 + 3^3 + ... + 10^10 = 10405071317.//// Find the last ten digits of the series, 1^1 + 2^2 + 3^3 + ... + 1000^1000.#include #includ

#pragma once#include class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt // Access: public

#pragma once#include class MoonMath{public: MoonMath(void); ~MoonMath(void); //************************************ // Method: IsInt // Access: public // Describe:

// Problem 39// 14 March 2003//// If p is the perimeter of a right angle triangle with integral length sides, {a,b,c}, there are exactly three solutions for p = 120.//// {20,48,52}, {24,45,51}, {

// Problem 26// 13 September 2002//// A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given://// 1/2 = 0.5// 1/3 = 0

// Problem 25// 30 August 2002// // The Fibonacci sequence is defined by the recurrence relation:// // Fn = Fn1 + Fn2, where F1 = 1 and F2 = 1.// Hence the first 12 terms will be:// // F1 = 1

// Problem 23// 02 August 2002//// A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1

// Problem 30// 08 November 2002//// Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits://// 1634 = 14 + 64 + 34 + 44// 8208 = 84 + 24 + 04

// Problem 24// 16 August 2002//// A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are list

// 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

using System;using System.Collections.Generic;using System.Text;namespace projecteuler020{ class Program { static void Main(string[] args) { F1(); }

// 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 re

using System;using System.Collections.Generic;using System.Text;namespace projecteuler017{ class Program { /// /// 1~19含的字母数 /// static int[] d1_19 = new

// Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.// // 37107287533902102798797998220837590246510135740250// 463769376774900097126481248969700780504170182605

// In the 2020 grid below, four numbers along a diagonal line have been marked in red.// // 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08// 49 49 99 40 17 81 18 57 60 87 17 40 98 43 6

// A Pythagorean triplet is a set of three natural numbers, a b c, for which,// // a2 + b2 = c2// For example, 32 + 42 = 9 + 16 = 25 = 52.// // There exists exactly one Pythagorean triplet for

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