LittleMoon's blog

By LittleMoon, 2 years ago, In English

Hello Everyone! On Saturday, December 26, 2022, at 18:00UTC+5.5, Coding and Logic vertical of Shaastra will be hosting Shaastra Programming Contest, and we would like to invite all of you for the same.

Contest Link: click here

cutt.ly/SPC_Prelims

Fill this form to be considered eligible for participation certificate and prizes — click here Note: Registration on unstop is compulsory but not sufficient.

It will be a combined unrated round for all divisions. You can participate in a team of 2 or individually.

Click here to register for the contest.

Note: Only students who have registered will be eligible for prizes.

The contest consists of 8-9 problems [ICPC Style Scoring] to be solved in 2 hours. Unlike usual codeforces rounds, The problems are not sorted based on their difficulty level. The problems will be fun and exciting to solve for you guys.

The round will provide a good range of problems in terms of difficulty, and every problem will be thrilling for the participants.

The top 30 teams in this round will get a chance to participate in the Finals, which is an offline event to be conducted at IIT Madras.

The problems were prepared by me and Juswanth_T. We would like to thank:

  • We are also grateful to Shaastra, IIT Madras for overseeing the contest conduction, KLA Corporation for sponsoring our event

Click here to Join our discord channel for queries, updates and announcements

The contest would definitely be fun and exciting for all the participants.

Good luck and see you in the standings!

We would like to thank everyone who participated in this competition, Thanks for making it a grand success.

Congratulations to all winners!

Top 5 Teams in Prelims(Teams who solved at least 8 problems)

Rank Competitors
1 Ultra Pro Max Penalty : akshaykhandelwal, harsh__h
2 amigos : gupta_nitin, ritikmital
3 C+=1 : sharmaharisam, WAtoAC2001
4 Updating... : ak82, sg0071729
5 BForBrute : DrearyJoke, Yomapeed

Top 7 Teams in Finals(Teams who solved at least 4 problems)

Rank Competitors
1 SmolBrain
2 amigos : gupta_nitin, ritikmital
3 Everything is Relative : HHN93, Chahel
4 Code_Manga^DJ : Kruthic, AdC_AB2
5 TeamKD : suneet27, rtzrtz
6 Pocket Aces : KDVinit, Kira_1234
7 Outliers : _prabhakar_, satyarthP

First Solves in Finals:

Problem Team Time of Solve
A amigos : gupta_nitin, ritikmital 00:10
B No solves :) --:--
C No solves :) --:--
D SmolBrain 01:25
E Updating... : ak82, sg0071729 00:45
F SmolBrain 01:05
G SmolBrain 00:07

A special thanks to non-IITM students who showed up for the On-site Round, hope you had some fun :-)

See you all in Shaastra 2024?

  • Vote: I like it
  • +55
  • Vote: I do not like it

»
2 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Glad to have tested the beautiful problems!

»
2 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Happy to test the round :) Problems are really amazing.

»
2 years ago, # |
  Vote: I like it +9 Vote: I do not like it

As a tester, I invite you to participate...the problems are quite interesting.

»
2 years ago, # |
  Vote: I like it +8 Vote: I do not like it

As a tester, I tested and also found the problems to be noice :)

»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

As a tester , the problems are really great and invite all to participate in the contest.

»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

As a tester I found the questions very interesting and nice

»
2 years ago, # |
  Vote: I like it +5 Vote: I do not like it

As a tester, the problems are interesting and educational. Good luck to everyone!

»
2 years ago, # |
Rev. 2   Vote: I like it +5 Vote: I do not like it

As a tester , the problems are very good. I gladly invite you all to participate. Looking Forward for you participation :)

»
2 years ago, # |
  Vote: I like it +4 Vote: I do not like it

As a tester , the problems are so good , you will definitley enjoy solving them

»
2 years ago, # |
  Vote: I like it +2 Vote: I do not like it

As a tester, I enjoyed solving the problems. Problems are good and interesting.

»
2 years ago, # |
Rev. 2   Vote: I like it +1 Vote: I do not like it

As a tester, I am glad to invite you to this wonderful contest

»
2 years ago, # |
  Vote: I like it +18 Vote: I do not like it

As a tester, I recommend you to participate in the contest, the problems are outstanding, and you'll enjoy solving them.

All the best, everyone!

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

link not opening

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I really liked all your problems! Thank you :)

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Any hint for H?

  • »
    »
    2 years ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    let's say d is a divisor of n and if the string s can be represented as a repeating sequence of length d. Then d is the period of s. Let's define the magic number of strings = minimum period d of the string.

    For example, the magic number of the string "abcabcabc" = 3.

    suppose if a string s is a palindrome, with the magic number d. Then string containing the first d characters of s is also a palindrome?

    For example, "abaabaaba" has a magic number = 3, and "aba" is also a palindrome.

    So can you try now?

»
2 years ago, # |
  Vote: I like it +11 Vote: I do not like it

Is there any possibility to get the editorial for these problems. We would be very thankful to you.

Btw, problems were really interesting :)

  • »
    »
    2 years ago, # ^ |
    Rev. 2   Vote: I like it +13 Vote: I do not like it

    Sorry for the delay,we will release the editorial by tomorrow evening. Thanks for your feedback :-)

»
2 years ago, # |
  Vote: I like it +13 Vote: I do not like it

Thanks for participating in the contest. I am happy that most of you liked solving the problems in the round. It might not be a good contest for you, but we hope you learn a few new things. I have gone through every single feedback. I apologize for the mistakes from our side. We will improve in the coming rounds.

»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

could you please share the editorial for this contest