Can someone counter case(help me find the flaw or what else i have to do ) my solve for E 65107304 . the idea : for contestant_1 iterate i from 1 to n; keep 1 to i and throw the rest away. So, res variable stores the best value for i such that we throw the minimum while filling the missing ones. The same for contestant 2 ... i start from i+1 to n; use thrown away numbers from const_1 or bring them from const_3...and throw the rest away.

ooo...got it ......of binary number.....thanks

How to solve d2c . I saw some submissions they used builtin function . Wondering what the function represent?

that is great thinking but I thought I handled overlapping segments. For type 1 segments I merged the segments . and for type 0 I checked is they are ok after building the array: 56343410 Can You give me a small hack..please?

what is pretest 3 in B

never mind...got it :(

well..i bet it's either my f''ing luck...or codeforces is initializing them with 'S' cause i don't think global variable gets initiazied with 'S'.. what do u think??

can u please explain this majk...... & MikeMirzayanov ?

same problem ..vai

yes an empty string.... not =='S'...doesn't empty string means ..we get 0....anything is other than 'S'..shouldn't print no..

why got WA on div2 A... Logic seems ok to me...if there is adjacent S to W I printed NO http://codeforces.me/contest/948/submission/36177886

Only problem seems i am checking an empty string...but it doesn't have 'SW' match any way