[Rust] Nothing to do at night, practice questions

tobot

[Rust] Nothing to do at night, practice questions [Copy link]

I wonder if you have heard of Project Euler http://pe-cn.github.io/problems/

Randomly pick a question to play with, for example, you happen to pick 526

Let f(n) be the largest prime factor of n.

Let g(n) = f(n) + f(n+1) + f(n+2) + f(n+3) + f(n+4) + f(n+5) + f(n+6) + f(n+7) + f(n+8), which is the sum of the largest prime factors of nine consecutive numbers starting from n.

Let h(n) be the maximum value of g(k) in 2 ≤ k ≤ n.

The topic itself is simple and easy to implement

But it gets stuck as soon as it starts running. Apparently there is something wrong with the algorithm. Does anyone have any idea for solving this problem?

hellokitty_bean

To be frank, was attracted by "nothing happened at night"!

Boss, are you testing the performance of the machine?

tang5722917

The maximum value of an unsigned 64 int is 4294967295. Have you ever counted how many zeros there are in h()?

tobot

tang5722917 posted on 2024-6-11 17:16 The maximum value of an unsigned 64 int is 4294967295. Have you ever counted how many zeros there are in h()?

u64 is only this small? I thought it could support up to 2 to the power of 64...

freebsder

Stuck? Isn't Rust supposed to be problem-free once it's compiled?