結果
問題 | No.49 算数の宿題 |
ユーザー |
![]() |
提出日時 | 2016-07-22 13:54:55 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 138 ms / 5,000 ms |
コード長 | 3,260 bytes |
コンパイル時間 | 2,919 ms |
コンパイル使用メモリ | 79,024 KB |
実行使用メモリ | 41,396 KB |
最終ジャッジ日時 | 2024-12-23 01:52:54 |
合計ジャッジ時間 | 4,556 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 10 |
ソースコード
import java.awt.geom.Point2D;import java.io.*;import java.math.*;import java.util.*;import java.util.Map.*;class Main {public static void main(String[] args) {//FastScanner sc = new FastScanner();Scanner sc = new Scanner(System.in);String S = sc.next();String[] ss = S.split("\\*|\\+");int f = Integer.parseInt(ss[0]);int id = 0;for(int i = 0; i < ss.length-1; i++) {id += ss[i].length();if(S.charAt(id) == '+') {f *= Integer.parseInt(ss[i+1]);}else {f += Integer.parseInt(ss[i+1]);}id++;}System.out.println(f);}static 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();}}}}