Codeforces Round 943 (Div. 3) || Editorial for Problem A,B,C,D,E

A. Maximize? || B. Prefiquence || C. Assembly via Remainders || D. Permutation Game || E. Cells Arrangement
contest URL: codeforces.com...
Contact me:-
LinkedIn - / swapnil-tayal-53a5b4221
Instagram - / swapnil_tayal
#codeforces #cp #cpp #educational #EducationalCodeforces #div3 #div2 #codeforcessolutions #editorial #educational #Codeforces943 #943

[@sabaokangan]

Thank you so much for sharing with us ❤ from New York

[@nicspyy]

ohh !! video reached new york, ✌️ welcome

[@nicspyy]

B solution: void solve(){ int n,m; cin>>n>>m; string a,b; cin>>a>>b; int j=0; int k=0; for(int i=0; iind2; ind2--; ind1--; vi a(n), v(n); forn(i,0,n){ cin>>v[i]; v[i]--; } forn(i,0,n) cin>>a[i]; vi b, s, vb(n), vs(n); while(!vs[ind2]){ s.push_back(a[ind2]); vs[ind2] = true; ind2 = v[ind2]; } while(!vb[ind1]){ b.push_back(a[ind1]); vb[ind1] = true; ind1 = v[ind1]; } int sb = 0; int sc = 0; int csb = 0; int csc = 0; for(int i=0; i

[@ayushgaur235]

in problem A simply print input-1 and it will work

[@nicspyy]

Your task is to find any integer y (1 ≤ y < x), then how -1?

[@mayankrohilla4105]

@@nicspyy the answer will be n-1, not -1

[@nicspyy]

@@mayankrohilla4105 ohh !! that also works great

[@Now_I_am_all_fired_up]

Expected Rating of D ... ?

[@nicspyy]

1300 - 1400 most probaly