HeNeos' blog

I’ve been inactive on writing for a long time, many thins happened. I’m also now AWS SysOps certified, it went better than I thought. Anyway, let’s start with the topic of this entry. [Read More]

I’ve been postponing the post for this fun small project for many weeks. Don’t blame me, I’ve still been working on more project euler problems and studying for the AWS Data Engineer Certification. [Read More]

After so much time, I’ve finally reach the top ranking 2 in my country in Project Euler. I still have a really long run to achieve the top 1, but the most important thing is the path. [Read More]

I have so much fun with this problem ~maybe, because it’s about euclidean geometry~. I think the easiest part is to reach to some conclusions finding similarities and applying some geometry theorems, then the boring part is just the computation. Anyway, I think this will be a good excuse to... [Read More]

This problem at first seems more intimidating, but it is enough to realize what are the conditions for a number to be a repunit. Then, just need to optimize by noticing what the boundaries of each base are to reduce the time complexity. [Read More]