stardevilm

क्यों है चर्चा मैं ? जयंती मेम अभी इसलिए चर्चा मैं है क्युकी उनकी आज 26 जुलाई को उनका निधन होगया है | वो एक कन्नड़ अभिनेत्री है जो की कही फिल्मो में काम कर चुकी है | उनकी मृत्यु आज सुबह ही हुई है क्युकी उनके रेस्पिरेटरी ऑर्गन्स में तकलीफ हो रही थी , … Read more

Organizing a Music Festival solution codeforces   You are the organizer of the famous “Zurich Music Festival”. There will be nn singers who will perform at the festival, identified by the integers 11, 22, ……, nn. You must choose in which order they are going to perform on stage. You have mm friends and each of them has a set of favourite singers. … Read more

Guess the Perimeter solution codeforces   Let us call a point of the plane admissible if its coordinates are positive integers less than or equal to 200200. There is an invisible rectangle such that: its vertices are all admissible; its sides are parallel to the coordinate axes; its area is strictly positive. Your task is to guess the … Read more

A Serious Referee solution codeforces   Andrea has come up with what he believes to be a novel sorting algorithm for arrays of length nn. The algorithm works as follows. Initially there is an array of nn integers a1,a2,…,ana1,a2,…,an. Then, kk steps are executed. For each 1≤i≤k1≤i≤k, during the ii-th step the subsequence of the array aa with indexes ji,1<ji,2<⋯<ji,qiji,1<ji,2<⋯<ji,qi is sorted, without changing the values with … Read more

Telepanting solution codeforces   An ant moves on the real line with constant speed of 11 unit per second. It starts at 00 and always moves to the right (so its position increases by 11 each second). There are nn portals, the ii-th of which is located at position xixi and teleports to position yi<xiyi<xi. Each portal can be either active or inactive. The initial state of the ii-th portal is … Read more

Colors and Intervals solution codeforces   The numbers 1,2,…,n⋅k1,2,…,n⋅k are colored with nn colors. These colors are indexed by 1,2,…,n1,2,…,n. For each 1≤i≤n1≤i≤n, there are exactly kk numbers colored with color ii. Let [a,b][a,b] denote the interval of integers between aa and bb inclusive, that is, the set {a,a+1,…,b}{a,a+1,…,b}. You must choose nn intervals [a1,b1],[a2,b2],…,[an,bn][a1,b1],[a2,b2],…,[an,bn] such that: for each 1≤i≤n1≤i≤n, it holds 1≤ai<bi≤n⋅k1≤ai<bi≤n⋅k; for each 1≤i≤n1≤i≤n, the numbers aiai and bibi are colored with color ii; each number 1≤x≤n⋅k1≤x≤n⋅k belongs to at most ⌈nk−1⌉⌈nk−1⌉ intervals. One can … Read more

Array Differentiation solution codeforces   You are given a sequence of nn integers a1,a2,…,ana1,a2,…,an. Does there exist a sequence of nn integers b1,b2,…,bnb1,b2,…,bn such that the following property holds? For each 1≤i≤n1≤i≤n, there exist two (not necessarily distinct) indices jj and kk (1≤j,k≤n1≤j,k≤n) such that ai=bj−bkai=bj−bk. Input The first line contains a single integer tt (1≤t≤201≤t≤20) — the number of test cases. Then tt test cases follow. The first line of each … Read more

Maximize the Intersections solution codeforces   On a circle lie 2n2n distinct points, with the following property: however you choose 33 chords that connect 33 disjoint pairs of points, no point strictly inside the circle belongs to all 33 chords. The points are numbered 1,2,…,2n1,2,…,2n in clockwise order. Initially, kk chords connect kk pairs of points, in such a way that all the 2k2k endpoints of these chords are distinct. You … Read more