Hard Cut solution codeforces – You are given a binary string š s. You have to cut it into any number of non-intersecting substrings, so that the sum of binary integers denoted by these substrings is a power of 2. Each element ofĀ š sĀ should be in exactly one substring. [Solution] Hard Cut solution codeforces Each test contains … Read more
Euclid Guess solution codeforces – Let’s consider Euclid’s algorithm for finding the greatest common divisor, whereĀ š”tĀ is a list: function Euclid(a, b): if a < b: swap(a, b) if b == 0: return a r = reminder from dividing a by b if r > 0: append r to the back of t return Euclid(b, r) … Read more
Diverse Segments solution codeforces – You are given an array šaĀ ofĀ šnĀ integers. Also you are givenĀ šmĀ subsegments of that array. The left and the right endpoints of theĀ šj-th segment areĀ ššljĀ andĀ ššrjĀ respectively. [Solution] Diverse Segments solution codeforces You are allowed to makeĀ no more than oneĀ operation. In that operation you choose any subsegment of the arrayĀ šaĀ and replace each value on … Read more
MEX vs DIFF solution codeforces – You are given an array šaĀ ofĀ šnĀ non-negative integers. In one operation you can change any number in the array to any other non-negative integer. [Solution] MEX vs DIFF solution codeforces Let’s define theĀ costĀ of the array asĀ DIFF(š)āMEX(š)DIFFā”(a)āMEXā”(a), whereĀ MEXMEXĀ of a set of non-negative integers is the smallest non-negative integer not present in … Read more
Traps solution codeforces – There are šnĀ traps numbered fromĀ 11Ā toĀ šn. You will go through them one by one in order. TheĀ ši-th trap dealsĀ ššaiĀ base damage to you. [Solution] Traps solution codeforces Instead of going through a trap, you can jump it over. You can jump over no more thanĀ škĀ traps. If you jump over a trap, it does … Read more
Column Swapping solution codeforces – You are given a grid with šnĀ rows andĀ šmĀ columns, where each cell has a positive integer written on it. Let’s call a gridĀ good, if in each row the sequence of numbers is sorted in a non-decreasing order. It means, that for eachĀ 1ā¤šā¤š1ā¤iā¤nĀ andĀ 2ā¤šā¤š2ā¤jā¤mĀ the following holds:Ā šš,šā„šš,šā1ai,jā„ai,jā1. [Solution] Column Swapping solution codeforces You have … Read more
Z mod X = C solution codeforces – You are given three positive integers ša,Ā šb,Ā šcĀ (š<š<ša<b<c). [Solution] Z mod X = C solution codeforces You have to find three positive integersĀ š„x,Ā š¦y,Ā š§zĀ such that: š„modš¦=š,xmody=a, š¦modš§=š,ymodz=b, š§modš„=š.zmodx=c. HereĀ šmodšpmodqĀ denotes the remainder from dividingĀ špĀ byĀ šq. It is possible to show that for such constraints the answer always exists. Input The input … Read more
Digit Minimization solution codeforces – There is an integer šnĀ without zerosĀ in its decimal representation. Alice and Bob are playing a game with this integer. Alice starts first. They play the game in turns. [Solution] Digit Minimization solution codeforces On her turn, AliceĀ mustĀ swap any two digits of the integer that are on different positions. Bob on … Read more
Binary String Game solution codechef – There is a binary string SS. Alice and Bob are playing a game on it. Each turn, the following happens: Alice selects aĀ 0101Ā subsequence inĀ SSĀ and removes it fromĀ SS. (aĀ 0101Ā subsequence is a lengthĀ 22Ā subsequence whose first character isĀ 00Ā and second character isĀ 11) Bob selects aĀ 0101Ā subsequence inĀ SSĀ and removes it fromĀ SS. After both players have … Read more
Ā Smallest Element In Progression solution codechef – You are given a prime number PPĀ and two integersĀ A,BA,B. Your task is to find the minimum value ofĀ (ATā B)modP(ATā B)modPĀ over all nonnegative integersĀ TT. [Solution] Smallest Element In Progression solution codechef The only line of input contains three space-separated integersĀ P,A,BP,A,B. It’s guaranteed thatĀ PPĀ is prime. Output Format Output the minimum value ofĀ (ATā B)modP(ATā B)modPĀ over … Read more