#734482 (Java21) No.1809 Divide NCK

• 問題: No.1809 Divide NCK
• ユーザー: nishi5451
• 提出日時: 2022-01-27 21:23:57
• 言語: Java21 (openjdk 21)
• 結果: WA
• 実行時間: -
• コード長: 2,668 bytes
• コンパイル時間: 2,258 ms
• コンパイル使用メモリ: 77,916 KB
• 実行使用メモリ: 37,188 KB
• 最終ジャッジ日時: 2024-06-07 18:47:09
• 合計ジャッジ時間: 5,387 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	WA	-
testcase_01	AC	48 ms; 36,664 KB
testcase_02	WA	-
testcase_03	WA	-
testcase_04	WA	-
testcase_05	WA	-
testcase_06	WA	-
testcase_07	WA	-
testcase_08	WA	-
testcase_09	WA	-
testcase_10	WA	-
testcase_11	AC	49 ms; 36,852 KB
testcase_12	AC	47 ms; 36,668 KB
testcase_13	AC	48 ms; 36,456 KB
testcase_14	WA	-
testcase_15	WA	-
testcase_16	AC	47 ms; 36,676 KB
testcase_17	WA	-
testcase_18	AC	48 ms; 36,780 KB
testcase_19	AC	46 ms; 36,852 KB
testcase_20	WA	-
testcase_21	WA	-
testcase_22	AC	46 ms; 36,784 KB
testcase_23	WA	-
testcase_24	WA	-
testcase_25	WA	-
testcase_26	WA	-
testcase_27	WA	-
testcase_28	WA	-
testcase_29	AC	48 ms; 36,868 KB
testcase_30	AC	49 ms; 36,336 KB
testcase_31	WA	-
testcase_32	WA	-
testcase_33	WA	-
testcase_34	AC	48 ms; 36,960 KB
testcase_35	WA	-
testcase_36	AC	47 ms; 37,088 KB
testcase_37	AC	48 ms; 36,768 KB
testcase_38	WA	-
testcase_39	WA	-
testcase_40	WA	-
testcase_41	WA	-

ソースコード

import java.util.*;
import java.util.stream.*;
import java.io.*;

public class Main {
	static final int INF = 1<<30;
	static final long INFL = 1L<<60;
	static final int MOD = 1000000007;
	static final int MOD2 = 998244353;
	static List<List<Integer>> g;
	static long f(long n, long m){
		long ret = 0;
		long p = m;
		while(n >= p){
			ret += n/p;
			if(n/p >= m) break;
			p *= m;
		}
		return ret;
	}
	
	public static void main(String[] args) {
		FastScanner fs = new FastScanner();
		PrintWriter pw = new PrintWriter(System.out);
		long n = fs.nextLong();
		long k = fs.nextLong();
		long m = fs.nextLong();
		long ans = f(n, m) - f(n-k, m) - f(k, m);
		pw.println(ans);
	
		pw.close();
	}
}

class FastScanner {
	private InputStream in = System.in;
	private byte[] buffer = new byte[1024];
	private int length = 0, p = 0;
	private boolean hasNextByte() {
		if (p < length) return true;
		else{
			p = 0;
			try{
				length = in.read(buffer);
			}catch(Exception e){
				e.printStackTrace();
			}
			if(length == 0) return false;
		}
		return true;
	}
	private int readByte() {
		if (hasNextByte() == true) return buffer[p++];
		return -1;
	}
	private static boolean isPrintable(int n) {
		return 33 <= n && n <= 126;
	}
	private void skip() {
		while (hasNextByte() && !isPrintable(buffer[p])) p++;
	}
	public boolean hasNext() {
		skip();
		return hasNextByte();
	}
	public String next() {
		if(!hasNext()) throw new NoSuchElementException();
		StringBuilder sb = new StringBuilder();
		int temp = readByte();
		while (isPrintable(temp)) {
			sb.appendCodePoint(temp);
			temp = readByte();
		}
		return sb.toString();
	}
	public int nextInt() {
		return Math.toIntExact(nextLong());
	}
	public int[] nextInts(int n) {
		int[] ar = new int[n];
		for (int i = 0; i < n; i++) ar[i] = nextInt();
		return ar;
	}
	public long[] nextLongs(int n) {
		long[] ar = new long[n];
		for (int i = 0; i < n; i++) ar[i] = nextLong();
		return ar;
	}
	public long nextLong() {
		if(!hasNext()) throw new NoSuchElementException();
		boolean minus = false;
		int temp = readByte();
		if (temp == '-') {
			minus = true;
			temp = readByte();
		}
		if (temp < '0' || '9' < temp) throw new NumberFormatException();
		long n = 0;
		while (isPrintable(temp)) {
			if ('0' <= temp && temp <= '9') {
				n *= 10;
				n += temp - '0';
			}
			temp = readByte();
		}
		return minus ? -n : n;
	}
	public char[] nextChars() {
		String s = next();
		return s.toCharArray();
	}
	public char[][] nextCharMat(int h, int w) {
		char[][] ar = new char[h][w];
		for(int i = 0; i < h; i++){
			String s = next();
			for(int j = 0; j < w; j++){
				ar[i][j] = s.charAt(j);
			}
		}
		return ar;
	}
}