Latest Posts

March 16, 2025

CreateBlog Picture

A Guide to Affordable VPS Providers for Side Projects | Cheapest VPS/Servers/Instance for Side Projects

Raunit Verma- inProjects

How to Find Budget-Friendly VPS Solutions for Students

March 26, 2025

CreateBlog Picture

Deploy Your Own Email Validator | Unlimited Email Validator [Email Verifier for Free] AfterShip OSS

Raunit Verma- inProjects

Validate your email lists effortlessly with our unlimited email validator. Deploy your own email verifier for free and enhance your email marketing strategy today. Ensure your emails reach the right inboxes with our free, unlimited email validator. Deploy your own email verifier and boost your marketing effectiveness now. Optimize your email campaigns with our free email validator. Deploy your own unlimited email verifier and improve deliverability with ease. Start validating today!

March 26, 2025

CreateBlog Picture

B. Playing in a Casino | Codeforces Solution | Codeforces Round 861 (Div. 2)

Raunit Verma- inCodeforces

Galaxy Luck, a well-known casino in the entire solar system, introduces a new card game. In this game, there is a deck that consists of 𝑛 cards. Each card has π‘š numbers written on it. Each of the 𝑛 players receives exactly one card from the deck. Then all players play with each other in pairs, and each pair of players plays exactly once. Thus, if there are, for example, four players in total, then six games are played: the first against the second, the first against the third, the first against the fourth, the second against the third, the second against the fourth and the third against the fourth.

March 15, 2025

CreateBlog Picture

D. Plus Minus Permutation | Codeforces Solution | Codeforces Round 895 (Div. 3)

Raunit Verma- inCodeforces

You are given 3 integers β€” 𝑛 , π‘₯ , 𝑦 . Let's call the score of a permutation† 𝑝1,…,𝑝𝑛 the following value: (𝑝1β‹…π‘₯+𝑝2β‹…π‘₯+…+π‘βŒŠπ‘›π‘₯βŒ‹β‹…π‘₯)βˆ’(𝑝1⋅𝑦+𝑝2⋅𝑦+…+π‘βŒŠπ‘›π‘¦βŒ‹β‹…π‘¦) In other words, the score of a permutation is the sum of 𝑝𝑖 for all indices 𝑖 divisible by π‘₯ , minus the sum of 𝑝𝑖 for all indices 𝑖 divisible by 𝑦 . You need to find the maximum possible score among all permutations of length 𝑛 . For example, if 𝑛=7 , π‘₯=2 , 𝑦=3 , the maximum score is achieved by the permutation [2,6⎯⎯,1⎯⎯,7⎯⎯,5,4⎯⎯⎯⎯,3] and is equal to (6+7+4)βˆ’(1+4)=17βˆ’5=12 .

March 11, 2025

CreateBlog Picture

A. Reverse a Substring | Codeforces Solution | Educational Codeforces Round 63 (Rated for Div. 2)

Raunit Verma- inCodeforces

You are given a string 𝑠 consisting of 𝑛 lowercase Latin letters. Let's define a substring as a contiguous subsegment of a string. For example, "acab" is a substring of "abacaba" (it starts in position 3 and ends in position 6 ), but "aa" or "d" aren't substrings of this string. So the substring of the string 𝑠 from position 𝑙 to position π‘Ÿ is 𝑠[𝑙;π‘Ÿ]=𝑠𝑙𝑠𝑙+1β€¦π‘ π‘Ÿ . You have to choose exactly one of the substrings of the given string and reverse it (i. e. make 𝑠[𝑙;π‘Ÿ]=π‘ π‘Ÿπ‘ π‘Ÿβˆ’1…𝑠𝑙 ) to obtain a string that is less lexicographically. Note that it is not necessary to obtain the minimum possible string.

March 11, 2025

CreateBlog Picture

D. Three Activities | Codeforces Solution | Codeforces Round 916 (Div. 3)

Raunit Verma- inCodeforces

Winter holidays are coming up. They are going to last for 𝑛 days. During the holidays, Monocarp wants to try all of these activities exactly once with his friends: go skiing; watch a movie in a cinema; play board games. Monocarp knows that, on the 𝑖 -th day, exactly π‘Žπ‘– friends will join him for skiing, 𝑏𝑖 friends will join him for a movie and 𝑐𝑖 friends will join him for board games.

March 07, 2025

CreateBlog Picture

B. Sequence Game | Codeforces Solution | Codeforces Round 894 (Div. 3)

Raunit Verma- inCodeforces

Tema and Vika are playing the following game. First, Vika comes up with a sequence of positive integers π‘Ž of length π‘š and writes it down on a piece of paper. Then she takes a new piece of paper and writes down the sequence 𝑏 according to the following rule: First, she writes down π‘Ž1 . Then, she writes down only those π‘Žπ‘– (2β‰€π‘–β‰€π‘š ) such that π‘Žπ‘–βˆ’1β‰€π‘Žπ‘– . Let the length of this sequence be denoted as 𝑛 .

March 07, 2025

CreateBlog Picture

A. Unit Array | Codeforces Solution | Codeforces Round 879 (Div. 2)

Raunit Verma- inCodeforces

Given an array π‘Ž of length 𝑛 , which elements are equal to βˆ’1 and 1 . Let's call the array π‘Ž good if the following conditions are held at the same time: π‘Ž1+π‘Ž2+…+π‘Žπ‘›β‰₯0 ; π‘Ž1β‹…π‘Ž2β‹…β€¦β‹…π‘Žπ‘›=1 . In one operation, you can select an arbitrary element of the array π‘Žπ‘– and change its value to the opposite. In other words, if π‘Žπ‘–=βˆ’1 , you can assign the value to π‘Žπ‘–:=1 , and if π‘Žπ‘–=1 , then assign the value to π‘Žπ‘–:=βˆ’1 .

March 04, 2025

CreateBlog Picture

B. Divan and a New Project | Codeforces Solution | Codeforces Round 757 (Div. 2)

Raunit Verma- inCodeforces

The company "Divan's Sofas" is planning to build 𝑛+1 different buildings on a coordinate line so that: the coordinate of each building is an integer number; no two buildings stand at the same point. Let π‘₯𝑖 be the coordinate of the 𝑖 -th building. To get from the building 𝑖 to the building 𝑗 , Divan spends |π‘₯π‘–βˆ’π‘₯𝑗| minutes, where |𝑦| is the absolute value of 𝑦 .

March 03, 2025

CreateBlog Picture

B. Shoe Shuffling | Codeforces Solution | CodeCraft-22 and Codeforces Round 795 (Div. 2)

Raunit Verma- inCodeforces

A class of students got bored wearing the same pair of shoes every day, so they decided to shuffle their shoes among themselves. In this problem, a pair of shoes is inseparable and is considered as a single object. There are 𝑛 students in the class, and you are given an array 𝑠 in non-decreasing order, where 𝑠𝑖 is the shoe size of the 𝑖 -th student. A shuffling of shoes is valid only if no student gets their own shoes and if every student gets shoes of size greater than or equal to their size.

MDM Calculator Poster
MDM Calculator
4.3

10K+ Downloads

Mid Day Meal Calculator is a user-friendly app designed to help teachers calculate the cost of mid-day meals for a day and generate a report in pdf format. The app is designed to make calculating meal costs simple and efficient. With the app's easy-to-use interface, teachers can create their own ingredients and price list according to their needs.

Download MDM Calculator