[백준] 2163. 초콜릿 자르기 풀이

https://www.acmicpc.net/problem/2163

 

초콜릿을 가로로 전부 자른 후 나온 조각들을 세로로 전부 자르면 되므로 다음과 같은 수식을 통해 쪼갠 횟수를 구할 수 있다.
(N-1) + {(M-1) * N}

 

---

C

#include <stdio.h>

int main() {
    int n, m; scanf("%d %d", &n, &m);
    int cnt = n - 1 + (m - 1) * n;
    printf("%d", cnt);
}

---

Python

n, m = map(int, input().split())
cnt = n - 1 + (m - 1) * n
print(cnt)

---

Java

import java.util.Scanner;

public class Main {
    public static void main(String args[]) {
      Scanner s = new Scanner(System.in);
      int n = s.nextInt(), m = s.nextInt();
      int cnt = 0;
      cnt += n-1;
      cnt += (m-1) * n;
      System.out.print(cnt);
    }
}

---

JavaScript

var [n, m] = require('fs').readFileSync(0).toString().split(" ").map(Number)
cnt = 0
cnt += n-1
cnt += (m-1) * n
console.log(cnt)