洛谷试炼场--1-2顺序与分支（java版）

P1422 小玉家的电费

代码：

import java.text.DecimalFormat;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int n =scanner.nextInt();
		double sum = 0;
		if(n<=10000){
			if(n<=150){
				sum = n*0.4463;
			}else{
				sum = sum+(150*0.4463);
				if(n>150&&n<=400){
					int a = n-150;
					sum = sum +(a*0.4663);
				}else{
					sum = sum + (250*0.4663);
					sum = sum + (n-400)*0.5663;
				}
			}
			DecimalFormat df =new DecimalFormat("0.0");
			System.out.println(df.format(sum));
		}
	}
}

P1085 不高兴的陶陶

输入输出样例
输入样例#1： 
5 3
6 2
7 2
5 3
5 4
0 4
0 6
输出样例#1： 
3

代码：

import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int a[][] = new int[7][3];
		for(int i=0;i<7;i++){
			a[i][0] = scanner.nextInt();
			a[i][1] = scanner.nextInt();
			a[i][2] = a[i][0]+a[i][1]-8;
		}
		int max =-10;
		int j =0;
		int flag = 0;
		for(int i=0;i<7;i++){
			if(a[i][2]>0){
				flag = 1;
			}
			if(a[i][2]>max){
				max = a[i][2];
				j = i;
			}
		}
		if(flag ==0){
			System.out.println("0");
		}else{
			System.out.println(j+1);
		}
	}

}

P1089 津津的储蓄计划

输入输出样例
输入样例#1： 
290
230
280
200
300
170
340
50 
90 
80 
200
60 
输出样例#1： 
-7 
输入样例#2： 
290 
230 
280 
200 
300 
170 
330 
50 
90 
80 
200 
60 
输出样例#2： 
1580

代码：

import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner scanner = new Scanner(System.in);
		int a[] = new int[12];
		for(int i=0;i<12;i++){
			a[i] = scanner.nextInt();
		}
		int b[] = new int[12];
		for(int i=0;i<12;i++){
			b[i] = 300;
		}
		int change = 0;
		int save = 0;
		int flag = 1;
		for(int i=0;i<12;i++){
			if(b[i]+change>=a[i]){
				int x = b[i]+change-a[i];
				x = x/100;
				save = save+x*100;
				change = b[i]+change-a[i]-x*100;
			}else{
				flag = 0;
				System.out.println(-i-1);
				return;
			}
		}
		if(flag ==1){
			int y = (int) (save+save*0.2);
			System.out.println(y+change);
		}
	}

}

细心！认真！
加油~