[백준 알고리즘] javascript 소수 1312번

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

function solution(A, B, N) {
  let answer = 0;
  for (let i = 0; i <= N; i++) {
    answer = parseInt(A / B);
    A = (A % B) * 10;
  }

  return answer;
}

let [A, B, N] = require("fs")
  .readFileSync("/dev/stdin")
  .toString()
  .trim()
  .split(" ");

console.log(solution(A, B, N));