[ADD] BOJ 10174 팰린드롬

- 구현

Author: tdm1223

acmicpc.net/README.md

@@ -272,6 +272,7 @@
 | 203  |   [알고리즘 수업 - 알고리즘의 수행 시간 4](https://www.acmicpc.net/problem/24265)    | [cpp](source/24265.cpp) | 204  |                   [콘서트](https://www.acmicpc.net/problem/16466)                    | [cpp](source/16466.cpp) |
 | 205  |                     [저항](https://www.acmicpc.net/problem/1076)                     | [cpp](source/1076.cpp)  | 206  |                [공사장 표지판](https://www.acmicpc.net/problem/23055)                | [cpp](source/23055.cpp) |
 | 207  |                  [Ресторан](https://www.acmicpc.net/problem/23738)                   | [cpp](source/23738.cpp) | 208  |                  [자동완성](https://www.acmicpc.net/problem/24883)                   | [cpp](source/24883.cpp) |
+| 209  |                  [팰린드롬](https://www.acmicpc.net/problem/10174)                   | [cpp](source/10174.cpp) |      |                                                                                      |                         |
 
 </details>
 

acmicpc.net/source/10174.cpp

@@ -0,0 +1,45 @@
+// 10174. 팰린드롬
+// 2022.04.16
+// 구현
+#include<iostream>
+#include<string>
+
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+    cin.ignore();
+    string s;
+    for (int i = 0; i < n; i++)
+    {
+        getline(cin, s);
+        bool IsPalindrome = true;
+        for (int i = 0; i < s.size(); i++)
+        {
+            if (s[i] >= 'A' && s[i] <= 'Z')
+            {
+                s[i] = tolower(s[i]);
+            }
+        }
+
+        for (int i = 0; i < s.size() / 2; i++)
+        {
+            if (s[i] != s[s.size() - i - 1])
+            {
+                IsPalindrome = false;
+                break;
+            }
+        }
+        if (IsPalindrome)
+        {
+            cout << "Yes" << endl;
+        }
+        else
+        {
+            cout << "No" << endl;
+        }
+    }
+    return 0;
+}