leetcode/euler/src/main.rs at master · wsgggws/leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
// 基础题
pub mod p0001_multiples_of_3_and_5;
pub mod p0002_even_fibonacci_numbers;
pub mod p0003_largest_prime_factor;
pub mod p0004_largest_palindrome_product;
pub mod p0005_smallest_multiple;
pub mod p0006_sum_square_difference;
pub mod p0008_largest_product_in_a_series;
pub mod p0017_number_letter_counts;
pub mod p0022_names_scores;

// 序列
pub mod p0014_longest_collatz_sequence;
// 92

// 因子
pub mod p0012_highly_divisible_triangular_number;
pub mod p0021_amicable_numbers;
pub mod p0023_non_abundant_sums;
pub mod p0047_distinct_primes_factors;

// 素数
pub mod p0007_10001st_prime;
pub mod p0010_summation_of_primes;
pub mod p0027_quadratic_primes;
pub mod p0035_circular_primes;
pub mod p0037_truncatable_primes;
pub mod p0050_consecutive_prime_sum;
// 50, 58, 97

// 数字游戏
pub mod p0009_special_pythagorean_triplet;
pub mod p0011_largest_product_in_a_grid;
pub mod p0028_number_spiral_diagonals;
pub mod p0030_digit_fifth_powers;
pub mod p0032_pandigital_products;
pub mod p0034_digit_factorials;
pub mod p0036_double_base_palindromes;
pub mod p0038_pandigital_multiples;
pub mod p0040_champernownes_constant;
pub mod p0046_goldbachs_other_conjecture;
// 52, 206

// 大整数
pub mod p0013_large_sum;
pub mod p0016_power_digit_sum;
pub mod p0020_factorial_digit_sum;
pub mod p0025_1000_digit_fibonacci_number;
pub mod p0029_distinct_powers;
pub mod p0048_self_powers;
// 53, 55, 56, 57, 63

// 路径
pub mod p0015_lattice_paths;
pub mod p0018_maximum_path_sum_i;
pub mod p0067_maximum_path_sum_ii;

// 排列组合
pub mod p0024_lexicographic_permutations;
pub mod p0031_coin_sums;
pub mod p0041_pandigital_prime;
pub mod p0043_sub_string_divisibility;
pub mod p0049_prime_permutations;

// 日期
pub mod p0019_counting_sundays;

// 分数
pub mod p0026_reciprocal_cycles;
pub mod p0033_digit_cancelling_fractions;

// 三角形数
pub mod p0039_integer_right_triangles;
pub mod p0042_coded_triangle_numbers;
pub mod p0044_pentagon_numbers;
pub mod p0045_triangular_pentagonal_and_hexagonal;

// 密码学
// 59, 79

fn main() {
    println!("Hello, rust and euler");
}