結果

問題 No.836 じょうよ
ユーザー 37zigen37zigen
提出日時 2020-02-17 16:14:32
言語 Java11
(openjdk 11.0.7)
結果
AC  
実行時間 129 ms / 1,000 ms
コード長 2,850 Byte
コンパイル時間 2,187 ms
使用メモリ 38,424 KB
最終ジャッジ日時 2020-07-09 11:54:07

テストケース

テストケース表示
入力 結果 実行時間
使用メモリ
testcase_00 AC 74 ms
34,264 KB
testcase_01 AC 97 ms
34,272 KB
testcase_02 AC 74 ms
34,276 KB
testcase_03 AC 74 ms
34,260 KB
testcase_04 AC 74 ms
36,256 KB
testcase_05 AC 74 ms
34,252 KB
testcase_06 AC 76 ms
36,292 KB
testcase_07 AC 79 ms
34,268 KB
testcase_08 AC 74 ms
34,244 KB
testcase_09 AC 74 ms
34,256 KB
testcase_10 AC 88 ms
36,296 KB
testcase_11 AC 90 ms
34,328 KB
testcase_12 AC 88 ms
34,316 KB
testcase_13 AC 82 ms
34,296 KB
testcase_14 AC 98 ms
34,308 KB
testcase_15 AC 129 ms
37,176 KB
testcase_16 AC 123 ms
37,168 KB
testcase_17 AC 98 ms
38,424 KB
testcase_18 AC 100 ms
34,468 KB
testcase_19 AC 114 ms
36,628 KB
testcase_20 AC 86 ms
38,240 KB
testcase_21 AC 100 ms
36,512 KB
testcase_22 AC 115 ms
37,168 KB
testcase_23 AC 87 ms
38,260 KB
testcase_24 AC 89 ms
34,316 KB
testcase_25 AC 89 ms
34,320 KB
testcase_26 AC 89 ms
38,344 KB
testcase_27 AC 102 ms
34,308 KB
testcase_28 AC 94 ms
34,308 KB
testcase_29 AC 85 ms
34,308 KB
testcase_30 AC 98 ms
34,332 KB
testcase_31 AC 86 ms
34,312 KB
testcase_32 AC 86 ms
34,412 KB
testcase_33 AC 100 ms
36,184 KB
testcase_34 AC 95 ms
34,320 KB
testcase_35 AC 108 ms
36,600 KB
testcase_36 AC 112 ms
36,608 KB
testcase_37 AC 117 ms
36,612 KB
testcase_38 AC 103 ms
36,520 KB
testcase_39 AC 125 ms
37,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;

class Main {
	public static void main(String[] args) throws Exception {
		new Main().run();
	}
	//0,1,...,x に  %m で y に等しいものがいくつあるか。 
	//min+i*m<=x
	//i*m<=x-min
	long f(long x,long min,long mod) {
		if(x<min)return 0;
		return (x-min)/mod+1;
	}
	
	void run() {
		Scanner sc=new Scanner();
		long l=sc.nextLong();
		long r=sc.nextLong();
		int n=sc.nextInt();
		PrintWriter pw=new PrintWriter(System.out);
		for(int i=0;i<n;++i) {
			pw.println(f(r,i,n)-f(l-1,i,n));
		}
		pw.close();
	}
	
	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}

class Scanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}
0