Project Euler
xushenbao_123
一个技能树点歪的ACMER
展开
-
Projuect Euler 23
Non-abundant sums 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 sum of the proper divisors of 28 would be 1 + 2 +原创 2017-06-30 13:50:27 · 313 阅读 · 0 评论 -
Problem 24 Lexicographic permutations (全排列)
Lexicographic permutations Problem 24 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 li原创 2017-07-04 12:42:38 · 250 阅读 · 0 评论 -
Euler Project 29
Distinct powers Problem 29 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 52=25, 53=125, 54=原创 2017-07-05 01:06:25 · 255 阅读 · 0 评论 -
Coin sums Problem 31
Coin sums Problem 31 In 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原创 2017-07-05 16:09:49 · 325 阅读 · 0 评论 -
Triangular, pentagonal, and hexagonal Problem 45
翻译: 三角数,五角数和六角数分别通过以下公式定义:三角数 Tn=n(n+1)/2 1, 3, 6, 10, 15, … 五角数 Pn=n(3n-1)/2 1, 5, 12, 22, 35, … 六角数 Hn=n(2n-1) 1, 6, 15, 28, 45, … 可以证实 T285 = P165 = H143 = 40755.找出这之后的下一个既是五角数又是六角数的三角数。思路:原创 2017-07-06 22:36:56 · 249 阅读 · 0 评论 -
Self powers Problem 48
The series, 11 + 22 + 33 + … + 1010 = 10405071317.Find the last ten digits of the series, 11 + 22 + 33 + … + 10001000.Answer: 9110846700#include<bits/stdc++.h> using namespace std; const long long mod原创 2017-07-07 12:00:11 · 333 阅读 · 0 评论 -
Prime permutations Problem 49
The arithmetic sequence, 1487, 4817, 8147, in which each of the terms increases by 3330, is unusual in two ways: (i) each of the three terms are prime, and, (ii) each of the 4-digit numbers are permuta原创 2017-07-07 14:00:58 · 218 阅读 · 0 评论 -
拉宾米勒测试
参见: http://www.cnblogs.com/Mathics/p/4028819.html#include<bits/stdc++.h> using namespace std; long long pow_mod(long long base,long long power,long long mod) { // cout<<base<<endl; if(power==0)原创 2017-07-08 22:31:13 · 533 阅读 · 0 评论