Contest Experiences | Codeforces Educational Round #143 (Rated for Div. 2)

About the contest:

Codeforce is a Website That creates a contest Program. Codeforce hosts different types of contests. Rated or unrated contest. One type hosts the contest, like Codeforce Educational Round Who are the contestants in this contest? This site is the same as Codechef and HackerRank, but the difficulty level is high.

Codeforce Educational Round #143 (rated For Division 2) is a competitive Program contest Hosted on the Codeforce platform.

• Competitive programming involves programmers competing against each other to resolve programming questions in a limited amount of time.
• These cases are regularly held over the Internet or a local network.
• The competitors in the occurrences are known as sports programmers. Contestants answer logical or analytical programming questions in the coding expression of their choice.
• The number of questions can change, depending on the contest. The results are deduced based on the number of questions solved, the opportunity taken to answer the problems, and different elements like execution time, program length, etc.

Benefits and Prizes:

Codeforces Educational Rounds usually do not offer physical prizes or monetary rewards. Participants fight for rating points and the comfort of resolving entertaining problems.

Link of the contest: https://codeforces.com/contest/1795

Overview of questions

• Duration: 2 hour,
• Contest Type: Competitive Programming,
• Rating Restriction: Division 2 participants only

A.	Two Towers	800	Accepted	30 ms	1
Problem number	Problem name	Difficulty Laval (rating based)	Verdict	Time taken by me	No.of submition
B.	Ideal Point	900	Accepted	78 ms	2
C.	Tea Tasting	1500	Wrong answer on test 1	0 ms	2
D.	Triangle Coloring	1600	Runtime error on test 6	15 ms	1
E.	Explosions?	2200	Compilation error	0 ms	2
F.	Blocking Chips	2400	–	–	–
G.	Removal Sequences	2700	–	–	–

Problem A:Tea Tasting

This is an easy and straight-forward problem. With basic knowledge of arrays and strings, you can solve this problem.
This type of problem is quickly and solved. This problem was solved in 10 to 15 minutes.
Approach: Take a two int value (means size for two string) and two string then reverse a second string and add the first string. Traverse the both string (i=1 to i<n + m),create count variable store a 0 value ,apply count += (s[i – 1] == s[i]);
then if count is greater then 1 then return yes else No

Problem B:Ideal Point

This problem is a little harder than Problem B. Deep understanding of data structures and algorithms. My initial approach was flawed, but I managed to correct it after some debugging. This problem took 25 to 35 minutes.
Input: The first line contains one integer t (1≤t≤1000) — the number of test cases.
The first line of each test case contains two integers n and k (1≤n,k≤50).
Then n lines follow, i-th line of them contains two integers li and ri (1≤li,ri≤50; li≤ri) — the endpoints of the i-th segment.
Approach: create a integer flag initialize is zero. Traverse the whole array, if first or second is equal to k then flag initialize by 1,then if flag equal to one the return yes else no.

Problem C: Tea Tasting

This is a medium problem and not a straight-for-word problem, so a deep understanding of DSA is needed. Problem C was a numerical problem that complicated the number hypothesis. I struggled with the mathematical ideas at first, but later, judging from some related materials, I was able to create a solution.

Problem D:Triangle Coloring

Problem D was one of the most challenging questions in the contest, requiring advanced data structures and algorithms. I spent an important amount of time trying to come up with an effective approach, but I couldn’t solve it during the contest. After the contest ended, I returned to this question and finally answered it.

Problem – E:

Problem E was another complicated situation that complicated active prioritization.
I made various attempts to resolve it all along the contest but couldn’t find the correct approach in the restricted period of time.

Problems F and G:

Most Difficult problem.

What is Division 2?

For rounds like “Div. 2 Only,” the above bound of the rating for official partnership is raised. Now all students whose grade is less than 2100 (that is, before masters) will be able to register for specific rounds to perform formally, and their grade will be revised based on the results of the round.

Skills Required:

• Wondering what skills are needed for competitive programming? Here is a list of essential skills for CP:
• Effective algorithm skills
• Dynamic programming (DP)
• Time-management skills
• Math skills (Basic)
• Debugging Logical reasoning
• Programming skills
• Analytical thinking
• Problem-solving abilities
• Organizational skills
• Binary search

Read this Article More about Knowledge: link

Conclusion:

• Challenging but valuable experience.
• Attempted first three questions during the contest.
• Last two questions were exceptionally tough.
• Didn’t achieve the desired rank.
• Realized the importance of modern problems and algorithms.
• Recognizes the need to manage time better in the future.
• Continued working on unsolved questions after the contest.
• Overall, these contests enhance problem-solving skills and algorithmic knowledge.
• Looking forward to the next challenge with the aim of improving.