算法 BISHI65 【模板】分数取模 思路 求解代码 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 private static final int MOD = 1000000007; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out)); int t = Integer.parseInt(br.readLine().trim()); for (int i = 0; i < t; i++) { String[] str = br.readLine().split("\\s+"); long a = Long.parseLong(str[0]); long b = Long.parseLong(str[1]); long bInv= mypower(b, MOD-2, MOD); long ans = (a%MOD+MOD)%MOD; ans = (ans*bInv)%MOD; out.println(ans); } out.flush(); out.close(); br.close(); } private static long mypower(long base, long exp, long mod) { long ans = 1 % mod; while (exp > 0) { if (exp % 2 == 1) { ans = (ans * base) % mod; } base = (base * base) % mod; exp /= 2; } return ans; }