Reminder: in case of any technical issues, you can use the lightweight website,, ×

YouKn0wWho's blog

By YouKn0wWho, 8 months ago, In English,

Well, one can count the number of primes less than or equal to n in (correct me if I am wrong) using Prime-counting function. You can solve this beautiful problem using the idea.

But recently I have come across following two (this and this) SPOJ problems with tag and have no idea how to solve them.

So If anyone can give me any idea about how to solve them, anyone will be appreciated respectfully. Thanks.

  • Vote: I like it
  • +38
  • Vote: I do not like it