This comment is hidden because it contains spoiler information about the solution
While I find the solution very clever I am not happy about the readability and keeping it maintainable in the long run.
I would extract sub methods getPrintErrorCount and getPrintTotalCount.
This way you can change finding errors in one dedicated method and printing the result in another methods.
damn that is a clever way of doing it. I was thinking there was probably a clever regex solution.....
The best! How it worksw? :-D
seriously it is works ;)
1 is not prime and 2 is prime. Your isPrime is incorrect.
That's bloody beautiful mate!
I thought that my solution was short, but u won dude :D
great job bro....
So simple, wonderful.
You have to return two decimal digits and don't truncate the number after the first one.
Java translation available.
LOL. My best effort yet :-)