its "atleast x" not x sorry :->

Revision en2, by pahad_charas_chai, 2020-09-06 20:23:59

problem link : https://atcoder.jp/contests/abc053/tasks/arc068_a

here in the problem it says that two opposite sides have sum = 7

then how for x = 7 only 2 moves are required

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English pahad_charas_chai 2020-09-06 20:23:59 42
en1 English pahad_charas_chai 2020-09-05 20:39:05 213 Initial revision (published)