/*
 * Copyright (c) 28th January 2012, Luca Risolia
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *     * Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *     * Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *     * Neither the name of the <organization> nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY <copyright holder> ``AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL <copyright holder> BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

#include <iostream>
#include <iomanip>
#include <vector>
#include <deque>
#include <string>
#include <cstring>
#include <iterator>
#include <list>

using namespace std;

template<typename InputIterator>
bool ispalindrome(InputIterator first, InputIterator last) {
    typename InputIterator::difference_type d = distance(first, last), i = 0;
    while (i < d - i) {
        InputIterator it = first;
        // std::advance() makes this template also usable for containers
        // not providing random access iterators (i.e list)
        if (*first++ != (advance(it, d - i - i - 1), *it))
            return false;
        i++;
    }
    return true;
}

template<typename T>
bool ispalindrome(const T& t) {
    return ispalindrome(t.begin(), t.end());
}

bool ispalindrome(const char* s) {
    const char *p = s + strlen(s) - 1;
    while (s < p)
        if (*s++ != *p--)
            return false;
    return true;
}

template<>
bool ispalindrome<int>(const int& n) {
    int r = 0, m = n;
    while (m > 0) {
        r = r * 10 + (m % 10);
        m /= 10;
    }
    return r == n;
}

int main(int argc, char** argv) {
    boolalpha(cout);

    cout << "Insert a number: ";
    int n;
    cin >> n;
    cin.ignore();
    cout << ispalindrome(n);

    cout << "\nInsert a word or a sentence: ";
    string s = "abba";
    getline(cin, s);

    cout << ispalindrome(s);
    cout << ispalindrome(s.c_str());
    cout << ispalindrome(vector<char>(s.begin(), s.end()));
    cout << ispalindrome(deque<char>(s.begin(), s.end()));
    cout << ispalindrome(list<char>(s.begin(), s.end()));

    return 0;
}