Submission #4132438


Source Code Expand

import java.io.*;
import java.util.*;
import java.util.Map.Entry;

public class Main {
	
	final boolean isDebug = false;
	String fileName = "input.txt";
	FastScanner sc;
	//PrintWriter out;
	final int MOD = 1000000007;
	
	/* solve */
	void solve(){
		int m = sc.nextInt();
		if(m < 100) System.out.println("00");
		if(m >= 100 && m <= 5000) System.out.printf("%02d\n", m / 100);
		if(m >= 6000 && m <= 30000) System.out.printf("%02d\n", m / 1000 + 50);
		if(m >= 35000 && m <= 70000) System.out.printf("%02d\n", (m / 1000 - 30) / 5 + 80);
		if(m > 70000) System.out.printf("%02d\n", 89);
		
	}
	/* end solve */
	
	/* main */
	public static void main(String[] args) throws IOException {
		new Main().m();
	}
	
	void m() throws IOException {
		long S = System.currentTimeMillis();
		sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);
		//out = new PrintWriter(System.out);
		solve();
		//out.flush();
		long G = System.currentTimeMillis();
		if(isDebug){
			System.out.println("---Debug---");
			System.out.printf("%7d ms", (G-S));
		}
	}
	/* end main */
}
/* end Main */

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    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());
    }
}

Submission Info

Submission Time
Task B - 視程の通報
User Oland
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 3415 Byte
Status AC
Exec Time 77 ms
Memory 21332 KB

Judge Result

Set Name all
Score / Max Score 100 / 100
Status
AC × 38
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 76 ms 18132 KB
00_sample_02.txt AC 73 ms 19284 KB
00_sample_03.txt AC 77 ms 18644 KB
test_01.txt AC 72 ms 19668 KB
test_02.txt AC 73 ms 18772 KB
test_03.txt AC 74 ms 19412 KB
test_04.txt AC 74 ms 21204 KB
test_05.txt AC 75 ms 20820 KB
test_06.txt AC 77 ms 18772 KB
test_07.txt AC 73 ms 19284 KB
test_08.txt AC 75 ms 18516 KB
test_09.txt AC 77 ms 20052 KB
test_10.txt AC 75 ms 18260 KB
test_11.txt AC 71 ms 18132 KB
test_12.txt AC 70 ms 19028 KB
test_13.txt AC 71 ms 20308 KB
test_14.txt AC 71 ms 19024 KB
test_15.txt AC 72 ms 21332 KB
test_16.txt AC 76 ms 17876 KB
test_17.txt AC 75 ms 20820 KB
test_18.txt AC 76 ms 21076 KB
test_19.txt AC 74 ms 19284 KB
test_20.txt AC 73 ms 18260 KB
test_21.txt AC 73 ms 19284 KB
test_22.txt AC 74 ms 18516 KB
test_23.txt AC 73 ms 17748 KB
test_24.txt AC 76 ms 19284 KB
test_25.txt AC 74 ms 19028 KB
test_26.txt AC 75 ms 19668 KB
test_27.txt AC 74 ms 17620 KB
test_28.txt AC 73 ms 21204 KB
test_29.txt AC 74 ms 18772 KB
test_30.txt AC 74 ms 19156 KB
test_31.txt AC 75 ms 20948 KB
test_32.txt AC 75 ms 17876 KB
test_33.txt AC 73 ms 18004 KB
test_34.txt AC 75 ms 21076 KB
test_35.txt AC 75 ms 16852 KB