結果
問題 | No.193 筒の数式 |
ユーザー | nCk_cv |
提出日時 | 2015-04-27 12:32:22 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 130 ms / 1,000 ms |
コード長 | 5,503 bytes |
コンパイル時間 | 2,832 ms |
コンパイル使用メモリ | 84,124 KB |
実行使用メモリ | 56,000 KB |
最終ジャッジ日時 | 2023-09-18 13:49:03 |
合計ジャッジ時間 | 6,319 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 127 ms
55,548 KB |
testcase_01 | AC | 128 ms
55,664 KB |
testcase_02 | AC | 130 ms
55,340 KB |
testcase_03 | AC | 128 ms
55,692 KB |
testcase_04 | AC | 128 ms
55,540 KB |
testcase_05 | AC | 129 ms
55,548 KB |
testcase_06 | AC | 127 ms
55,728 KB |
testcase_07 | AC | 129 ms
55,552 KB |
testcase_08 | AC | 128 ms
55,592 KB |
testcase_09 | AC | 128 ms
55,476 KB |
testcase_10 | AC | 127 ms
55,480 KB |
testcase_11 | AC | 127 ms
53,428 KB |
testcase_12 | AC | 128 ms
55,532 KB |
testcase_13 | AC | 127 ms
56,000 KB |
testcase_14 | AC | 129 ms
53,164 KB |
testcase_15 | AC | 128 ms
55,224 KB |
testcase_16 | AC | 128 ms
55,500 KB |
testcase_17 | AC | 129 ms
55,760 KB |
testcase_18 | AC | 129 ms
55,244 KB |
ソースコード
import java.awt.geom.Point2D; import java.io.*; import java.math.BigInteger; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.Arrays; import java.util.Collections; import java.util.Comparator; import java.util.Deque; import java.util.HashMap; import java.util.HashSet; import java.util.List; import java.util.NoSuchElementException; import java.util.PriorityQueue; import java.util.Scanner; import java.util.Stack; import java.util.TreeMap; public class Main { static PrintWriter out = new PrintWriter(System.out); static FastScanner sc = new FastScanner(); static Scanner stdIn = new Scanner(System.in); static int nowp; public static void main(String[] args) { String s = sc.next(); int max = Integer.MIN_VALUE; for(int i = 0; i < s.length(); i++) { String s1 = s.substring(0,i); String s2 = s.substring(i,s.length()); String s3 = s2 + s1; if(!isdigit(s3.charAt(0)) || !isdigit(s3.charAt(s3.length() -1))) continue; for(int j = 0; j < s3.length()-1; j++) { if(!isdigit(s3.charAt(j)) && !isdigit(s3.charAt(j+1))) { continue; } } nowp = 0; s3 += "="; int ans = expression(s3); max = Math.max(max,ans); } out.println(max); out.flush(); } static int expression(String a) { int ret = term(a); for(;;) { if(a.charAt(nowp) == '+') { nowp++; ret += term(a); } else if(a.charAt(nowp) == '-') { nowp++; ret -= term(a); } else { break; } } return ret; } static int term(String a) { int ret = factor(a); for(;;) { if(a.charAt(nowp) == '*') { nowp++; ret *= factor(a); } else if(a.charAt(nowp) == '/') { nowp++; ret /= factor(a); } else { break; } } return ret; } static int number(String a) { int ret = 0; while(isdigit(a.charAt(nowp))) { ret *= 10; ret += a.charAt(nowp) - '0'; nowp++; } return ret; } static int factor(String a) { if(a.charAt(nowp) == '(') { nowp++; int ret = expression(a); nowp++; return ret; } return number(a); } static boolean isdigit(char a) { if(a == '0' || a == '1' || a == '2' || a == '3' || a == '4' || a == '5' || a == '6' || a == '7' || a == '8' || a == '9') return true; return false; } } //------------------------------// //-----------// 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(); } } public double nextDouble() { return Double.parseDouble(next()); } }