https://codeforces.me/blog/entry/155685

https://codeforces.me/blog/entry/155685

https://codeforces.me/blog/entry/155685

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
• 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".

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
• 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.

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
• 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.

Hi everyone!

The Div. 3 round has just ended, and I'd like to share my thoughts.

I think problems A and B were a nice warm-up and quite straightforward. Problem C required a bit more observation, and after that the difficulty increased significantly.

I solved 1 problems and learned a lot from this round. I spent the most time on problem 10 minute, where a small mistake cost me a lot of time.

I'm curious about everyone else's experience:

• Which problem did you enjoy the most?
• Which problem was the hardest for you?
• Did you find any clever observations or interesting solutions?

Congratulations to everyone who gained rating, and good luck in the next contests!