![]() |
ABOUT THE CONTEST:
Link of the Contest: https://codeforces.com/contest/1846My Experience:I was able to solve 5 problems out of 7 problems in these contests. OVERVIEW OF ALL CONTEST PROBLEM:
LET’S DISCUSS THE QUESTIONS:Problem A – Rudolph and Cut the Rope In this problem we takes pairs of integers as input and counts how many times the first integer in each pair is greater than the second one. It does this for multiple test cases specified in the input and prints the count for each test case. Problem B- Rudolph and Tic-Tac-Toe To solve this for each test case: Read the 3×3 grid. Check rows, columns, and diagonals for winning combinations for ‘X’, ‘O’, and ‘+’. If any player (‘X’ or ‘O’ or ‘+’) has a winning combination, print that player’s symbol (‘X’, ‘O’, or ‘+’). If no player has a winning combination, print “DRAW”. Problem C- Rudolf and the Another Competition To solve this for each test case: Calculate the time it takes for each participant to solve each problem. Sort the problems for each participant based on time taken to solve them. Find the maximum number of problems Rudolf can solve within the given time. If there are ties in points and penalties, Rudolf’s position will be the best among those with the same score and penalty. Problem D – Rudolph and Christmas Tree To calculate the total area of the tree branches, we can use the following approach: For each branch, calculate the area of the triangle using the formula: Area =1/2 × base × height. The total area is the sum of the areas of all the triangles representing the branches. Problem E1- Rudolf and Snowflakes (simple version) To solve this for 1 or 2 vertices, a snowflake cannot be constructed according to the rules provided. For any other number of vertices: If the number is divisible by 3, a snowflake can be constructed based on the rules of snowflake formation. If the number is not divisible by 3, a snowflake cannot be constructed. Conclusion:At the end I was able to solve 5 problem out of 7 problem. For me last problems, I require more time to solve this last questions. |
Reffered: https://www.geeksforgeeks.org
Contest Experiences |
Type: | Geek |
Category: | Coding |
Sub Category: | Tutorial |
Uploaded by: | Admin |
Views: | 14 |