結果

問題 No.49 算数の宿題
ユーザー threepipes_s
提出日時 2014-11-27 19:48:37
言語 Java
(openjdk 23)
結果
AC  
実行時間 62 ms / 5,000 ms
コード長 5,391 bytes
コンパイル時間 3,443 ms
コンパイル使用メモリ 88,384 KB
実行使用メモリ 37,016 KB
最終ジャッジ日時 2024-12-23 01:43:04
合計ジャッジ時間 4,372 ms
ジャッジサーバーID
(参考情報)
judge2 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.List;
import java.util.TreeSet;
public class Main {
// public static int w;
// public static int k;
// public static int n;
// public static int[][] dp;
// public static int[] r;
// public static long[] buy;
// public static List<double[]> list = new ArrayList<double[]>();
// public static NodeW[] product;
public static void main(String[] args) throws NumberFormatException, IOException{
ContestScanner in = new ContestScanner();
String exp = in.nextToken();
int size = exp.length();
StringBuilder number = new StringBuilder();
int res = -1;
char oldOP = 0;
for(int i=0; i<size; i++){
char c = exp.charAt(i);
if('0' <= c && c <= '9'){
number.append(c);
}else{
int num = Integer.parseInt(number.toString());
number = new StringBuilder();
if(res == -1){
res = num;
}else if(oldOP == '+'){
res *= num;
}else{
res += num;
}
oldOP = c;
}
}
int num = Integer.parseInt(number.toString());
number = new StringBuilder();
if(res == -1){
res = num;
}else if(oldOP == '+'){
res *= num;
}else{
res += num;
}
if(res == -1) res = 0;
System.out.println(res);
}
}
//class MyComp implements Comparator<int[]>{
// public int compare(int[] a, int[] b) {
// return Main.product[a[0]].dist - Main.product[b[0]].dist;
// }
//}
class Reverse implements Comparator<Integer>{
public int compare(Integer arg0, Integer arg1) {
return arg1 - arg0;
}
}
class NodeW{
int id;
// int dist;
List<NodeW> edge = new ArrayList<NodeW>();
List<Integer> costList = new ArrayList<Integer>();
public NodeW(int id) {
this.id = id;
}
public void createEdge(Node node) {
System.err.println("Don't use this func");
}
public void createEdge(NodeW node, int cost) {
edge.add(node);
costList.add(cost);
// node.setDist(dist+1);
}
// public void setDist(int dist){
// this.dist = Math.max(this.dist, dist);
// for(NodeW node: edge){
// node.setDist(dist+1);
// }
// }
}
class Range<T extends Comparable<T>> implements Comparable<Range<T>>{
T start;
T end;
public Range(T start, T end){
this.start = start;
this.end = end;
}
public boolean inRange(T val){
if(start.compareTo(val) <= 0 && end.compareTo(val) >= 0){
return true;
}
return false;
}
public boolean isCommon(Range<T> range){
if(inRange(range.start) || inRange(range.end) || range.inRange(start)){
return true;
}
return false;
}
public Range<T> connect(Range<T> range){
if(!isCommon(range)) return null;
Range<T> res = new Range<T>(start.compareTo(range.start) <= 0 ? start : range.start,
end.compareTo(range.end) >= 0 ? end : range.end);
return res;
}
public boolean connectToThis(Range<T> range){
if(!isCommon(range)) return false;
start = start.compareTo(range.start) <= 0 ? start : range.start;
end = end.compareTo(range.end) >= 0 ? end : range.end;
return true;
}
@Override
public int compareTo(Range<T> range) {
int res = start.compareTo(range.start);
if(res == 0) return end.compareTo(range.end);
return res;
}
public String toString(){
return "["+start+","+end+"]";
}
}
class RangeSet<T extends Comparable<T>>{
TreeSet<Range<T>> ranges = new TreeSet<Range<T>>();
public void add(Range<T> range){
Range<T> con = ranges.floor(range);
if(con != null){
if(con.connectToThis(range))
range = con;
}
con = ranges.ceiling(range);
while(con != null && range.connectToThis(con)){
ranges.remove(con);
con = ranges.ceiling(range);
}
ranges.add(range);
}
public String toString(){
StringBuilder bld = new StringBuilder();
for(Range<T> r: ranges){
bld.append(r+"\n");
}
return bld.toString();
}
}
class Node{
int id;
List<Node> edge = new ArrayList<Node>();
public Node(int id){
this.id = id;
}
public void createEdge(Node node){
edge.add(node);
}
}
class MyMath{
public static long fact(long n){
long res = 1;
while(n > 0){
res *= n--;
}
return res;
}
public static long[][] pascalT(int n){
long[][] tri = new long[n][];
for(int i=0; i<n; i++){
tri[i] = new long[i+1];
for(int j=0; j<i+1; j++){
if(j == 0 || j == i){
tri[i][j] = 1;
}else{
tri[i][j] = tri[i-1][j-1] + tri[i-1][j];
}
}
}
return tri;
}
}
class ContestScanner{
private BufferedReader reader;
private String[] line;
private int idx;
public ContestScanner() throws FileNotFoundException{
reader = new BufferedReader(new InputStreamReader(System.in));
}
public String nextToken() throws IOException{
if(line == null || line.length <= idx){
line = reader.readLine().trim().split(" ");
idx = 0;
}
return line[idx++];
}
public long nextLong() throws IOException, NumberFormatException{
return Long.parseLong(nextToken());
}
public int nextInt() throws NumberFormatException, IOException{
return (int)nextLong();
}
public double nextDouble() throws NumberFormatException, IOException{
return Double.parseDouble(nextToken());
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0