Submission #764944


Source Code Expand

import java.io.IOException;
import java.io.InputStream;
import java.util.NoSuchElementException;

public class Main {
    FastScanner fs = new FastScanner();

    public static void main(String[] args) {
        new Main().solve();
    }

    void solve() {
        String[] Sound = {"Do","Re","Mi","Fa","So","La","Si",};
        String keyBoard = "WBWBWWBWBWBW";
        char[] keyBoardArray = keyBoard.toCharArray();
        int[] Pos = {0, 2, 4, 5, 7, 9, 11};
        String matchStr = "";
        String S = fs.next();
        for(int i = 0; i < 7; i++) {
            for(int j = Pos[i]; j < (Pos[i] + 20); j++) {
                matchStr += String.valueOf(keyBoardArray[j % 12]);
            }
            if(matchStr.equals(S)) {
                System.out.println(Sound[i]);
                return;
            }
            matchStr = "";
        }
    }
}

class FastScanner {
    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;
    }

    private void skipUnprintable() {
        while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
        skipUnprintable();
        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() {
        if (!hasNext()) throw new NoSuchElementException();
        int 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();
        }
    }
}

Submission Info

Submission Time
Task C - ピアニスト高橋君
User moomin
Language Java8 (OpenJDK 1.8.0)
Score 100
Code Size 3663 Byte
Status AC
Exec Time 158 ms
Memory 8148 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 1
AC × 8
Set Name Test Cases
Sample example_0.txt
All example_0.txt, handmade_0.txt, handmade_1.txt, handmade_2.txt, handmade_3.txt, handmade_4.txt, handmade_5.txt, handmade_6.txt
Case Name Status Exec Time Memory
example_0.txt AC 149 ms 7892 KiB
handmade_0.txt AC 150 ms 7892 KiB
handmade_1.txt AC 146 ms 7892 KiB
handmade_2.txt AC 147 ms 7888 KiB
handmade_3.txt AC 146 ms 8148 KiB
handmade_4.txt AC 143 ms 7888 KiB
handmade_5.txt AC 147 ms 7892 KiB
handmade_6.txt AC 158 ms 8016 KiB