hdoj简单题目（一）

hdoj1008

题意：电梯运送所需时间，不需要什么算法，一道模拟题目。每上一层楼需要6s，停一次5s，下一层楼4s

解题代码：

import java.util.*;public class Main1008 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n = sc.nextInt();while(n != 0) {int t = 0;int[] num = new int[n+1];num[0] = 0;for(int i=1; i<=n; i++) {num[i] = sc.nextInt();}t = 5*n;for(int j=1; j<=n; j++) {t += Math.abs(num[j]-num[j-1]) * (num[j]-num[j-1]<0 ? 4:6);}System.out.println(t+"");n = sc.nextInt();}}}

 

hdoj1496 利用hash数组的方式来完成此题

import java.util.*;public class Main1496 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);while(sc.hasNextInt()) {int a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt(), d = sc.nextInt(); if(a*b>0 && c*d>0 && a*c>0) { System.out.println(0); } else { int count = 0; int[] hash = new int[3000000];for(int i=1; i<=100; i++) {for(int j=1; j<=100; j++) {hash[a*i*i+b*j*j+1000000] ++;}}for(int m=1; m<=100; m++) {for(int n=1; n<=100; n++) {count += hash[-c*m*m-d*n*n+1000000];}}System.out.println(count*16); }}}}

 

hdoj1157 一个简单的排序，java中有现成的方法可以调用，但是这个还是很简单的，快排

import java.util.*;public class Main1157 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);while(sc.hasNextInt()) {int n = sc.nextInt();int[] num = new int[n];for(int i=0; i<num.length; i++) {num[i] = sc.nextInt();}for(int i=0; i<num.length; i++) {int k = i;for(int j=i+1; j<num.length; j++) {if(num[j] < num[k]) {k = j;}}if(k != i) {int temp = num[i];num[i] = num[k];num[k] = temp;}}System.out.println(num[num.length/2]);}}}

 

hdoj1106 为了成功提交还是很费劲的，有时候输入输出真的使人很麻烦，这个题用java来做还是很简单的

import java.util.*;public class Main1106 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);String s = new String();String[] sp;int[] num;while(sc.hasNext()) {s = sc.next();//去掉首尾的5.感觉很笨while(s.charAt(0) == '5') {s = s.substring(1);}while(s.charAt(s.length()-1) == '5') {s = s.substring(0,s.length()-1);}//"5+" once or more 5sp = s.split("5+");num = new int[sp.length];for(int i=0; i<sp.length; i++) {num[i] = Integer.parseInt(sp[i]);}Arrays.sort(num);for(int i=0; i<num.length; i++) {if(i == num.length-1) {System.out.println(num[i]);} else {System.out.print(num[i]+" ");}}}}}

 

hdoj2673 这个题目只需要一个排序，然后在循环中交替输出结果就ok了

import java.util.*;public class Main2673 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n;int[] num;while(sc.hasNextInt()) {n = sc.nextInt();num = new int[n];for(int i=0; i<num.length; i++) {num[i] = sc.nextInt();}Arrays.sort(num);for(int i=0; i<num.length; i++) {if(i%2 == 0) {if(i == num.length-1) {System.out.println(num[num.length-i/2-1]);} else {System.out.print(num[num.length-i/2-1]+" ");}} else {if(i == num.length-1) {System.out.println(num[(i+1)/2-1]);} else {System.out.print(num[(i+1)/2-1]+" ");}}}}}}