//An anti-Lychrel number is a number that forms a palindrome through the iterative process of repeatedly reversing its digits and adding the resulting numbers. For example, 56 becomes palindromic after one iteration: 56+65=121. If the number doesn't become palindromic after 30 iterations, then it is not an anti-Lychrel number. //Examples: //Input: 12 //Output: true (12 + 21 = 33, a palindrome) //Input: 57 //Output: true (57 + 75 = 132, 132 + 231 = 363, a palindrome) //Input: 10911 //Output: false (10911 takes 55 iterations to reach a palindrome) #include #include #include using namespace std; int main() { // to keep track of iterations int intIteration = 0; //input number long long intNum; cin >> intNum; long long intInput = intNum; do { intIteration += 1; cout << "For iteration : "<< intIteration << " , value is: "<< intNum << endl; //convert to string string strNum = to_string(intNum ); //reverse string reverse(strNum.begin(),strNum.end()); //convert to num for reverse num size_t sz; long long intRevNum = stoll(strNum,&sz,0); //total long long intTotal = intNum + intRevNum ; // total as string string strTotal = to_string(intTotal ); // total char in string int intCnt = strTotal.length(); // loop through all char bool boolPalindrome = true; for(int i=0;i < intCnt ;++i) { if(strTotal[i]!=strTotal[intCnt -1-i]) { boolPalindrome = false; break; } } if(boolPalindrome) { cout << intInput << " is lychrel number " << endl; return 0;// no further operation } else { // update new value of num intNum = intTotal ; } }while(intIteration !=30); // all iterations are over cout << intInput << " is anty lychrel number " << endl; return 0; }

Assignment_Lychrel number