Polynomials with at least one integer root
This problem is only solved by 400 people. But actually it is not a so difficult problem. I just felt that it was too complicated to consider all situations and never gave it a try.
Finally I decided to solve it. I am surprised to find that it was not difficult to implement. The algorithm was used again and again in PE problems. The code ran very fast, less than 0.1 second.
The math involved is not that much(All the ideas involved has been used many times). If you go this far, you definitely can solve it.
Hello, nice post! I often find myself giving up just because a problem looks too hard, and this problem is one of those. But most of the time, what I really need is a little confidence so that I have the conviction to continue coding. Your post has given me that! Thanks!
ReplyDelete