DailyAlgorithm/BaekJoon_1259.cpp at main · JasonShin10/DailyAlgorithm · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
using namespace std;

void findPelindrome(string s)
{
    for (int i = 0; i <= s.size()/2; i++)
    {
        if (s[i] != s[s.size() - 1 - i])
        {
            cout << "no" << "\n";
            return;
        }
    }
    cout << "yes" << "\n";
    return;
}

int main() {
    while (true)
    {
        int n;
        cin >> n;
        if (n == 0)
        {
            break;
        }
        string s;
        s = to_string(n);
        findPelindrome(s);
    }
    return 0;
}