Hi everyone! ↵
I recently tried my hand at problemsetting and created my very first problem. I would be very glad if you could take a couple of minutes to solve it and share your feedback in the comments!↵
↵
### About the Problem↵
* **Name:** Equal Ends↵
* **Problem Link:** [View Problem](https://codeforces.me/gym/705992/problem/A)↵
* **Time Limit:** 1 second↵
* **Memory Limit:** 256 megabytes↵
↵
### Problem Statement↵
You are given a string $s$ consisting of lowercase English letters. ↵
A string is called "good" if its first character is the same as its last character. ↵
Given the string $s$, determine whether it is good. Print `YES` if it is good, and `NO` otherwise.↵
↵
↵
↵
I would appreciate any feedback, suggestions, or criticism since this is my first experience creating problems! Good luck and happy coding!↵
↵
TASK↵
↵
A. Equal Ends↵
time limit per test: 1 second↵
memory limit per test: 256 megabytes↵
↵
Ibrahim found a string consisting of lowercase English letters.↵
↵
He calls a string "good" if its first character is the same as its last character.↵
↵
Given the string s, determine whether it is good.↵
↵
Input↵
↵
The only line contains a string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters.↵
↵
Output↵
↵
Print "YES" if the string is good. Otherwise, print "NO".↵
↵
Input↵
The only line contains a string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters.↵
↵
Output↵
Print "YES" if the string is good. Otherwise, print "NO".↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
I recently tried my hand at problemsetting and created my very first problem. I would be very glad if you could take a couple of minutes to solve it and share your feedback in the comments!↵
↵
### About the Problem↵
* **Name:** Equal Ends↵
* **Memory Limit:** 256 megabytes↵
↵
### Problem Statement↵
You are given a string $s$ consisting of lowercase English letters. ↵
A string is called "good" if its first character is the same as its last character. ↵
Given the string $s$, determine whether it is good. Print `YES` if it is good, and `NO` otherwise.↵
↵
↵
↵
I would appreciate any feedback, suggestions, or criticism since this is my first experience creating problems! Good luck and happy coding!↵
↵
TASK↵
↵
A. Equal Ends↵
time limit per test: 1 second↵
memory limit per test: 256 megabytes↵
↵
Ibrahim found a string consisting of lowercase English letters.↵
↵
He calls a string "good" if its first character is the same as its last character.↵
↵
Given the string s, determine whether it is good.↵
↵
Input↵
↵
The only line contains a string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters.↵
↵
Output↵
↵
Print "YES" if the string is good. Otherwise, print "NO".↵
↵
Input↵
The only line contains a string s (1 ≤ |s| ≤ 100), consisting of lowercase English letters.↵
↵
Output↵
Print "YES" if the string is good. Otherwise, print "NO".↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
↵
