Egypt, Helwan University

Team name: El judge Zalem Bas M3aya 3adel

samyh, _MANS0UR_, Kerna

Egypt, Helwan University

Team name: Hatzbot elmarady 3adel m2kdly

Ali_Azzam, MUZAN, _SHAHIN

Another test case

1
6 2
1 1 1 1 2 2
1 7

Expected Output: 2, Some solutions with output: 6 are Accepted

Egypt, Helwan University

Team 1 Name: Still We are not the same

Handles: _SHAHIN, _MANS0UR_, 3B3ATY

Team 2 Name: Yalaaahwy Ctrl Z bsor3a

Handles: Uchiha_Ouda, Zeyad_3BcarenO, gom3a_

Egypt,

Helwan University,

We are not the same

_SHAHIN, _MANS0UR_, 3B3ATY.

Egypt,

Helwan University,

We are not the same

_SHAHIN, 3B3ATY, _MANS0UR_

Thank you.

Need help in Div.2 D

What is the proof of this part from the tutorial: "If there is an odd number of ? in the unimportant nodes, then Dora will have to colour the root (after filling the ? in the unimportant nodes one by one)"

Why Iris need odd number of ? in the unimportant nodes (not only one appearance of ? in an unimportant node) and why Dora has to fill the unimportant nodes one by one?

i have made the same approach as you said, but i got some wrong test cases this is my submission: https://codeforces.me/contest/1870/submission/224067985

every loop I repeat what I have done with the first minimum element but taken k % last_minimum_element then storing the answer in an vector of pair containing the value to print and the index to print up to it

why it gives my wrong answer?