UVA 10970 - Big Chocolate

Root :: AOAPC I: Beginning Algorithm Contests -- Training Guide (Rujia Liu) ::  /*UVA 10970 - Big Chocolate 題意：計算將一塊n*m的巧克力切成n*m塊所需的次數 方法：咱們能夠先橫切，先切成n條，一共切了n-1刀，而後將每條都切m-1次，則一共切了 n - 1 +  n*( m - 1) =

>>阅读原文<<