Its talking the last char of your input by using modulo. input is: 12345 Cycle 1: new_num is 0, multiply by 10 give 0. add modulo or your input 12345 % 10 = 5, new_num is now 5. divide your input by 10 to remove last digit. input = 1234 Cycle 2,3,4 etc.: new_num is … Read more
Taking a look at the string constructor: … (7) template <class InputIterator> string (InputIterator first, InputIterator last); You can see it is possible to create a string via iterators. The rbegin/rend iterators are InputIterators that points to the reverse positions that they refer: rend() –>”My string”<– rbegin() That said, when you pass the rbegin() and … Read more
First take the words of str in an array. Then check whether the words in the forward order and the reverse order are same. String[] words = str.split(” “); //splits at spaces boolean flag = true; int i, last = words.length – 1; for(i = 0; i <= last/2; i++){ if(!words[i].equalsIgnoreCase(words[last – i])){ flag = … Read more
The easiest way to check if a number is a palindrom would probably to treat it as a string, flip it, and check if the flipped string is equal to the original. From there on, it’s just a loop that counts how many of these you’ve encounteres: begin = int(input(‘Enter begin: ‘)) end = int(input(‘Enter … Read more
Use True/False instead of true/false. You can consider True and False as somehow ‘keywords’ in Python. For Python scripts, you don’t use def main():. Instead, try using if __name__ == ‘__main__’: under global scope. Look at this for more info. You have to print something out rather than just return a boolean variable, by using … Read more
I think, this is program you are searching for. public class Palindrome { public static void main(String[] args) { for(int i=0;i<=25000;i++){ int number=i; int reverse=0; int temp=0; while(number>0){ temp=number%10; number=number/10; reverse=reverse*10+temp; // System.out.println(rev); if(i==reverse){ if(reverse%2!=0){ System.out.println(reverse); } } } } } } 1 solved Odd Palindrome generator (0 to 25000)
Solution: change palindrome to int palindrome ( int n,int base) { int isTrue = 1; int digitCount = digitCountBase(n,base); int power = intPow(base,digitCount-1); int original = n; while (n>0&& digitCount >0) { if (n%base != (original/power) % base &&digitCount!=1) { isTrue =0; return 0; } n=n/base; power = power /base; digitCount=digitCount-2; } return isTrue; } … Read more
Similar to previous answer but with the following suggestions Initialize longest and shortest. Ignore case when comparing. Could still do this with SequenceEqual instead of comparing strings. May not be needed if you know you won’t be comparing Anna to annA. When checking if you found the shortest you need to remember that shortest.Length with … Read more
“1 2” is not a string representing an int and therefore, it can not be parsed into an int. You need to split the such an input and then you can parse the individual elements into int values and perform the required arithmetic operation on them e.g. public class Main { public static void main(String[] … Read more
Thank you everyone, the code I found to be the answer was this: begin = int(input(‘Enter begin: ‘)) end = int(input(‘Enter end: ‘)) palindromes = palindromes = len([i for i in range(begin, end+1) if str(i) == str(i)[::-1]]) for i in range(begin, end+1): if str(i) == str(i)[::-1]: print(i,’is a palindrome’) print(‘There are’, palindromes, ‘palindrome(s) between’, begin, … Read more
You get to the size of elements, which is 1. However, if your array has only one element, which is the case for 1-digit numbers, then sizeof($_array) === 1. Which means that the biggest possible index you can use is 0. You need to change your code to something like this: <?php for ($num = … Read more
First for-loop fills an array of length x with user entered values. Second for-loop checks for array like this [1,2,3,3,2,1]. So it checks wether the array is reversev in the second half. Though because of the return the for-loop will be canceled at first run. So if the first entry of the array equals the … Read more
Some modified version of your code: #include <iostream> using namespace std; int main() { int max_product = 0; for (int i = 99; i > 9; i–) { for (int j = i; j > 9; j–) { int product = i * j; if (product < max_product) break; int number = product; int reverse … Read more