https://www.acmicpc.net/problem/1271
1271๋ฒ: ์์ฒญ๋ ๋ถ์2
์ฒซ์งธ ์ค์๋ ์ต๋ฐฑ์ค ์กฐ๊ต๊ฐ ๊ฐ์ง ๋ n๊ณผ ๋์ ๋ฐ์ผ๋ฌ ์จ ์๋ช ์ฒด์ ์ m์ด ์ฃผ์ด์ง๋ค. (1 ≤ m ≤ n ≤ 101000, m๊ณผ n์ 10์ง์ ์ ์)
www.acmicpc.net
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
BigInteger n = sc.nextBigInteger();
BigInteger m = sc.nextBigInteger();
BigInteger cost = n.divide(m);
BigInteger changes = n.mod(m);
System.out.println(cost);
System.out.println(changes);
}
}