Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <algorithm>
- #include <cctype>
- #include <cstdio>
- #include <cstdlib>
- #include <cstring>
- #include <fstream>
- #include <iostream>
- #include <sstream>
- #include <string>
- using namespace std;
- typedef long long int64;
- #define READ(f) freopen(f, "r", stdin)
- #define WRITE(f) freopen(f, "w", stdout)
- string stringToInt(int64 n) {
- stringstream ss;
- ss<<n;
- return (ss.str());
- }
- bool isPalindrom(int64 n) {
- bool flag = true;
- string s = stringToInt(n);
- string::iterator begin = s.begin();
- string::iterator end = s.end() - 1;
- for(;begin < end; begin++, end--) {
- if(*begin != *end) {
- flag = false;
- break;
- }
- }
- return flag;
- }
- int main() {
- //READ("input.txt");
- int64 number,testCase, temp, reverseNumber, sum, result;
- cin>>testCase;
- while(testCase--) {
- cin>>number;
- int counter = 0;
- while(1) {
- sum = 0;
- temp = number;
- reverseNumber = 0;
- while(temp){
- reverseNumber *= 10;
- reverseNumber += (temp % 10);
- temp /= 10;
- }
- sum = number + reverseNumber;
- counter++;
- if(isPalindrom(sum)) {
- result = sum;
- break;
- }
- number = sum;
- }
- cout<<counter<<" "<<result<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement