We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
for test case 1 , use unsigned long long int instead of long long int to store the number in base k...because 10^6 in binary will have around 20 digits and long long int causes overflow.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #36: Double-base palindromes
You are viewing a single comment's thread. Return to all comments →
for test case 1 , use unsigned long long int instead of long long int to store the number in base k...because 10^6 in binary will have around 20 digits and long long int causes overflow.