Tony's Log

摘要： My first reaction was, total No. of strings - no. of palindromic strings. But looks like counting all palindromic strings is not that easy.. So it has... 阅读全文

摘要： Please note input constraints. String length will not exceed 100, which means, we can use relatively naive representation\calculation for anagrams: so... 阅读全文

摘要： Sieve of Eratosthenesclass Solution {public: int countPrimes(int n) { if(n rec(n + 1, false); int bound = floor(sqrt(n)); i... 阅读全文