C++
文章平均质量分 88
jiafengfu
C++,Python,算法,AI/ML
展开
-
Project Euler Problem 7 (C++和Python代码实现和解析)
Problem 7 : 10001st primeBy 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 10 001st prime number?#include <iostream&a原创 2018-10-11 11:31:44 · 267 阅读 · 2 评论 -
Project Euler Problem 8 (C++和Python代码实现和解析)
Problem 8 : Largest product in a seriesThe four adjacent digits in the 1000-digit number that have the greatest product are 9 × 9 × 8 × 9 = 5832.7316717653133062491922511967442657474235534919493496...原创 2018-10-11 11:35:15 · 281 阅读 · 2 评论 -
Project Euler Problem 9 (C++和Python代码实现和解析)
Problem 9 : Special Pythagorean tripletA Pythagorean triplet is a set of three natural numbers, a < b < c, for which,a^2 + b^2 = c^2For example, 3^2 + 4^2 = 9 + 16原创 2018-10-11 11:38:23 · 379 阅读 · 3 评论 -
Project Euler Problem 10 (C++和Python代码实现和解析)
Problem 10 : Summation of primesThe sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.Find the sum of all the primes below two million.#include <iostream>#include原创 2018-10-11 11:40:45 · 332 阅读 · 2 评论 -
Project Euler Problem 14 (C++和Python代码实现和解析)
Problem 14 : Longest Collatz sequenceThe following iterative sequence is defined for the set of positive integers:n → n/2 (n is even)n → 3n + 1 (n is odd)Using the rule above and starting with 13,...原创 2018-10-12 10:32:20 · 369 阅读 · 2 评论 -
Project Euler Problem 15 (C++和Python代码实现和解析)
Problem 15 : Lattice pathsStarting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.How many such route...原创 2018-10-12 11:08:41 · 393 阅读 · 2 评论 -
Project Euler Problem 16 (C++和Python代码实现和解析)
Problem 16 : Power digit sum2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26.What is the sum of the digits of the number 2^1000?#include <iostream>#include &a原创 2018-10-15 10:56:54 · 405 阅读 · 2 评论 -
Project Euler Problem 17 (C++和Python代码实现和解析)
Problem 17 : Number letter countsIf the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.If all the numbers from 1 to...原创 2018-10-15 11:07:07 · 344 阅读 · 2 评论 -
Project Euler Problem 18 (C++和Python)
Problem 18 : Maximum path sum IBy 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.37 42 4 68 5 9 3That is, 3...原创 2018-10-15 14:36:04 · 258 阅读 · 2 评论 -
Project Euler Problem 19 (C++和Python代码实现和解析)
Problem 19 : Counting SundaysYou 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...原创 2018-10-15 15:54:51 · 226 阅读 · 4 评论 -
Project Euler Problem 20 (C++和Python)
Problem 20 : Factorial digit sumn! means n × (n − 1) × … × 3 × 2 × 1For example, 10! = 10 × 9 × … × 3 × 2 × 1 = 3628800,and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27...原创 2018-10-15 16:01:25 · 328 阅读 · 3 评论 -
Project Euler Problem 13 (C++和Python代码实现和解析)
Problem 13 : Large sumWork out the first ten digits of the sum of the following one-hundred 50-digit numbers.3710728753390210279879799822083759024651013574025046376937677490009712648124896970078050...原创 2018-10-12 10:05:19 · 254 阅读 · 2 评论 -
Project Euler Problem 12 (C++和Python代码实现和解析)
Problem 12 : Highly divisible triangular numberThe sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The fir...原创 2018-10-12 10:01:12 · 407 阅读 · 2 评论 -
Project Euler Problem 11 (C++和Python代码实现和解析)
Problem 11 : Largest product in a gridIn the 20×20 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 0849 49 99 40 17 8...原创 2018-10-12 09:54:53 · 335 阅读 · 2 评论 -
Project Euler Problem 21 (C++和Python)
Problem 21 : Amicable numbersLet 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 amicab...原创 2018-10-16 13:51:04 · 217 阅读 · 2 评论 -
Project Euler Problem 22 (C++和Python)
Problem 22 : Names scoresUsing names.txt (right click and ‘Save Link/Target As…’), a 46K text file containing over five-thousand first names, begin by sorting it into alphabetical order. Then working...原创 2018-10-16 13:58:28 · 340 阅读 · 2 评论 -
Project Euler Problem 23 (C++和Python)
Probelm 23 : Non-abundant sumsA 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 + 2 + ...原创 2018-10-16 14:01:14 · 202 阅读 · 2 评论 -
Project Euler Problem 24 (C++和Python)
Problem 24 : Lexicographic permutationsA 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 li...原创 2018-10-16 14:04:30 · 315 阅读 · 2 评论 -
Project Euler Problem 25 (C++和Python)
Problem 25 : 1000-digit Fibonacci numberThe Fibonacci sequence is defined by the recurrence relation:Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.Hence the first 12 terms will be:F1 = 1F2 = 1F3 = 2...原创 2018-10-16 14:08:04 · 212 阅读 · 3 评论 -
Project Euler Problem 1 (C++和Python代码实现和解析)
Euler Problem 2: Even Fibonacci numbersEach new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1, 2, 3, 5, 8, 13, ...原创 2018-10-10 17:59:12 · 336 阅读 · 3 评论 -
Project Euler Problem 2 (C++和Python代码实现和解析)
Euler Problem 1:Multiples of 3 and 5If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.Find the sum of all the multiples...原创 2018-10-10 18:11:01 · 325 阅读 · 2 评论 -
Project Euler Problem 3 (C++和Python代码实现和解析)
Euler Problem 3 : Largest prime factorThe prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ?#include <iostream>#incl原创 2018-10-10 18:14:24 · 300 阅读 · 3 评论 -
Project Euler Problem 4 (C++和Python代码实现和解析)
Euler Problem 4 : Largest palindrome productA 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 pali...原创 2018-10-10 18:18:12 · 276 阅读 · 2 评论 -
Project Euler Problem 5 (C++和Python代码实现和解析)
Euler Problem 5 : Smallest multiple2520 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 divis...原创 2018-10-10 18:27:35 · 243 阅读 · 1 评论 -
Project Euler Problem 6 (C++和Python代码实现和解析)
Euler Problem 6 : Sum square differenceThe sum of the squares of the first ten natural numbers is,1^2 + 2^2 + … + 10^2 = 385The square of the sum of the first ten natural numbers is,(1 + 2 + … + 1...原创 2018-10-10 19:15:52 · 230 阅读 · 2 评论 -
Project Euler Problem 26 (C++和Python)
Problem 26 : Reciprocal cyclesA unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to 10 are given:1/2 = 0.51/3 = 0.(3)1/4 = 0.251/...原创 2018-10-17 13:22:37 · 267 阅读 · 2 评论 -
Project Euler Problem 27 (C++和Python)
Problem 27 : Quadratic primesEuler discovered the remarkable quadratic formula:n^2+n+41It turns out that the formula will produce 40 primes for the consecutive integer values 0≤n≤39. However, when ...原创 2018-10-17 13:31:49 · 420 阅读 · 2 评论 -
Project Euler Problem 28 (C++和Python)
Problem 28 : Number spiral diagonalsStarting 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 2520 7 8 9 1019 6 1 2 1118 ...原创 2018-10-17 13:36:49 · 231 阅读 · 2 评论 -
Project Euler Problem 29 (C++和Python)
Problem 29 : Distinct powersConsider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:2^2=4, 2^3=8, 2^4=16, 2^5=323^2=9, 3^3=27, 3^4=81, 3^5=2434^2=16, 4^3=64, 4^4=256, 4^5=10245^2=25, ...原创 2018-10-17 13:40:11 · 285 阅读 · 2 评论 -
Project Euler Problem 30 (C++和Python)
Problem 30 : Digit fifth powersSurprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:1634 = 1^4 + 6^4 + 3^4 + 4^48208 = 8^4 + 2^4 + 0^4 + 8^4947...原创 2018-10-17 13:43:55 · 254 阅读 · 2 评论 -
Project Euler Problem 31 (C++和Python)
Problem 31 : Coin sumsIn England the currency is made up of pound, £, and pence, p, and there are eight coins in general circulation:1p, 2p, 5p, 10p, 20p, 50p, £1 (100p) and £2 (200p).It is possibl...原创 2018-10-22 18:20:29 · 266 阅读 · 2 评论 -
Project Euler Problem 32 (C++和Python)
Problem 32 : Pandigital productsWe 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 pandigi...原创 2018-10-22 18:22:45 · 230 阅读 · 2 评论 -
Project Euler Problem 33 (C++和Python)
Problem 33 : Digit cancelling fractionsThe 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...原创 2018-10-22 18:24:36 · 200 阅读 · 2 评论 -
Project Euler Problem 34 (C++和Python)
Problem 34 : Digit factorials145 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.Note: as 1! = 1 an...原创 2018-10-22 18:26:29 · 148 阅读 · 2 评论 -
Project Euler Problem 35 (C++和Python)
Problem 35 : Circular primesThe number, 197, is called a circular prime because all rotations of the digits: 197, 971, and 719, are themselves prime.There are thirteen such primes below 100: 2, 3, 5...原创 2018-10-22 18:30:31 · 244 阅读 · 2 评论 -
Project Euler Problem 41 (C++和Python)
Problem 41 : Pandigital primeWe 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 prime.What...原创 2018-10-28 11:58:29 · 201 阅读 · 2 评论 -
Project Euler Problem 42 (C++和Python)
Problem 42 : Coded triangle numbersThe 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, …By converti...原创 2018-10-28 15:48:17 · 250 阅读 · 2 评论 -
Project Euler Problem 43 (C++和Python)
Problem 43 : Sub-string divisibilityThe number, 1406357289, is a 0 to 9 pandigital number because it is made up of each of the digits 0 to 9 in some order, but it also has a rather interesting sub-st...原创 2018-10-29 11:06:39 · 209 阅读 · 2 评论 -
Project Euler Problem 44 (C++和Python)
Problem 44 : Pentagon numbersPentagonal numbers are generated by the formula, Pn=n(3n−1)/2. The first ten pentagonal numbers are:1, 5, 12, 22, 35, 51, 70, 92, 117, 145, …It can be seen that P4 + P7...原创 2018-10-29 14:06:25 · 225 阅读 · 2 评论 -
Project Euler Problem 45 (C++和Python)
Problem 45 : Triangular, pentagonal, and hexagonalTriangle, pentagonal, and hexagonal numbers are generated by the following formulae:Triangle Tn = n(n+1)/2 1, 3, 6, 10, 15, …Pentagonal Pn = n(3n−...原创 2018-10-29 15:35:13 · 299 阅读 · 2 评论