Arithmetic Expression

时间限制: 2000ms

单点时限: 200ms

内存限制: 256MB

描述

Given N arithmetic expressions, can you tell whose result is closest to 9?

输入

Line 1: N (1 <= N <= 50000).
Line 2..N+1: Each line contains an expression in the format of "a op b" where a, b are integers (-10000 <= a, b <= 10000) and op is one of addition (+), subtraction (-), multiplication (*) and division (/). There is no "divided by zero" expression.

输出

The index of expression whose result is closest to 9. If there are more than one such expressions, output the smallest index.

样例输入

样例输出

我的代码，仅供参考：

import java.util.Scanner;
public class Main {
   public static void main(String[] args) {
       Scanner input = new Scanner(System.in);
       int count = input.nextInt();
       if (count < 1 || count > 50000)
           return;
       double[] result = new double[count];
       int i = 0;
       // System.out.print("count:"+count);
       while (input.hasNextLine()) {
           String line = input.nextLine();
           System.out.println(line);
           if (line.contains("*")) {
               String num[] = line.split("\\*");
               int a = Integer.parseInt(num[0]);
               int b = Integer.parseInt(num[1]);
               if (a < -10000 || a > 10000)
                   return;
               if (b < -10000 || b > 10000)
                   return;
               double result_temp = a * b;
               result[i - 1] = Math.abs(result_temp - 9.0);
           } else if (line.contains("/")) {
               String num[] = line.split("\\/");
               int a = Integer.parseInt(num[0]);
               int b = Integer.parseInt(num[1]);
               if (a < -10000 || a > 10000)
                   return;
               if (b < -10000 || b > 10000)
                   return;
               double result_temp = a / b;
               result[i - 1] = Math.abs(result_temp - 9.0);
           } else if (line.contains("+")) {
               String num[] = line.split("\\+");
               int a = Integer.parseInt(num[0]);
               int b = Integer.parseInt(num[1]);
               if (a < -10000 || a > 10000)
                   return;
               if (b < -10000 || b > 10000)
                   return;
               double result_temp = a + b;
               result[i - 1] = Math.abs(result_temp - 9.0);
           } else if (line.contains("-")) {
               int p = line.indexOf("-");
               if (p == 0) {
                   String temp_str = line;
                   temp_str = temp_str.substring(1);
                   // System.out.println(temp_str);
                   p = temp_str.indexOf("-") + 1;
                   String a_s = line.substring(0, p);
                   String b_s = line.substring(p + 1);
                   int a = Integer.parseInt(a_s);
                   int b = Integer.parseInt(b_s);
                   if (a < -10000 || a > 10000)
                       return;
                   if (b < -10000 || b > 10000)
                       return;
                   double result_temp = a - b;
                   result[i - 1] = Math.abs(result_temp - 9.0);
               } else {
                   String a_s = line.substring(0, p);
                   String b_s = line.substring(p + 1);
                   int a = Integer.parseInt(a_s);
                   int b = Integer.parseInt(b_s);
                   if (a < -10000 || a > 10000)
                       return;
                   if (b < -10000 || b > 10000)
                       return;
                   double result_temp = a - b;
                   result[i - 1] = Math.abs(result_temp - 9.0);
               }
           }
           if (i == count) {
               break;
           }
           i++;
       }
       int minIndex = 0;
       double min;
       min = result[0];
       for (int index = 1; index < result.length; index++) {
           if (result[index] < min) {
               min = result[index];
               minIndex = index;
           }
       }
       System.out.println(minIndex + 1);
   }
}

Arithmetic Expression相关推荐

微软编程一小时比赛--题目1 : Arithmetic Expression
题目1 : Arithmetic Expression 时间限制:2000ms 单点时限:200ms 内存限制:256MB 描述 Given N arithmetic expressions, can ...
C++11中nullptr的使用
在C语言中,NULL实际上是一个void* 的指针,然后把void* 指针赋值给其它类型的指针的时候,会隐式转换成相应的类型.而如果用一个C++编译器来编译的时候是要出错的,因为C++是强类型的,vo ...
LeetCode实战：逆波兰表达式求值
题目英文 Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are ...
leetcode - 150. Evaluate Reverse Polish Notation
前言:记录一下leetcode上的一道题目: 题目网址:https://leetcode.com/problems/evaluate-reverse-polish-notation/descripti ...
ZOJ 3822 Known Notation(2014牡丹江Regional K题)
题目大意:给你一个不完整的后缀表达式和两种操作,一是插入一个数或者"*"运算号,另一个是把数字和"*"交换. 一个*至少对应两个数字,而一个表达式又等于一个数字 ...
NVelocity：语法
User Guide - Contents About this Guide 什么是NVelocity? NVelocity能为我们做什么? The Mud Store example Velocit ...
Python常用语句及流程控制
1. 赋值语句常用技巧通过序列解包(sequence unpacking)可以将多个值的序列解开,让后一一放置到变量的序列中.解包的序列中的元素必须和等号左边变量数量一致.如下: 1 values ...
用YACC/LEX 设计计算机语言
用YACC/LEX 设计计算机语言前言: YACC (Yet Another Compiler Compiler) 是1974年在 Unix 下设计出来的一个优秀的计算机语法分析工具.LEX 是相应 ...
12C OCP 1ZO-071 题库（8月以前）
071-67q 1 choose the best answer 选择最好的答案 exanine the desciption of the employees table: 员工表的填写: whic ...

Arithmetic Expression

描述

输入

输出

Arithmetic Expression相关推荐

最新文章

热门文章