We invite you to participate in CodeChef’s Starters 155, this Wednesday, 9th October, rated upto 5 stars (i.e. for users with rating < 2200)

Time: 8:00 PM — 10:00 PM IST

Joining us on the problem setting panel are:

Contest Admin and Statement Verifier: Yash yash_daga Daga

Setters: Manan mexomerf Grover, Ashish Kryptonix Gangwar, Harsh harsh__h, Bernard BERNARD Ibrahimcha

Tester: Manan mexomerf Grover

Text Editorialists: Nishank IceKnight1093 Suresh.

Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here. Hope to see you participating.

Good Luck!

The contest starts in around ~15 minutes.

What wrong with this

Replace With First's logic ?lets say s== lion, t = lioeeeeeeen we can make do o-> oeeeeeee in 1 operation but your code will give 2

thanks

i wrote the same logic but it wasn't working, I wanna know why so bad

You can remove an internal substring from the larger string to make it equal to the smaller string, that would take just one move too.

why is in gcd(hard) question, printing matrix with all number as 2 is wrong?

maybe because any row and column gcd will be 2 ??

Gcd should be 1 and not 2 in each row and column; printing 1 would make gcd 2; you should atleast look the given test cases

I have a question for those who solved problem Div1C (Div2D) Prefix Suffix Min Max ,

How did u figured out the solution ? did u solve almost similar problem before or solved it just now ?

It is a standard mathematical problem solved after the contest but i got WA when i took a[0] = 4 and when i chahged it to 2e6 it got AC .....

Idk in java it gave tle but in C++ it gives Ac

just assume a[0] to be the max element

solved for the first time.

-> a[0]=max(a[1]....a[n-1]) or 2000000

i liked array concatenation (although could not solve in contest)

was an easy observation u should have considered different cases

multiply by mod inverse