ACM POJ部分题目

hanyuanbo

浏览: 182628 次
性别:
来自: 深圳

最近访客更多访客>>

DamonDomino

abcd2010

den253176

cj19920801

博主相关

博客

微博

相册

留言

关于我

文章分类

社区版块

存档分类

博客分类：

试题集锦_poj

Java J#

以下是自己做的一些北京大学poj的acm题目，刚刚开始做，做的有些水。不断更新中。

package cn.edu.szpku.poj;

import java.math.BigDecimal;
import java.util.Scanner;

public class _1001 {
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		while (cin.hasNextBigDecimal()) {
			BigDecimal R = cin.nextBigDecimal();
			int n = cin.nextInt();
			R = R.pow(n);
			String answer = R.stripTrailingZeros().toPlainString();
			if (answer.startsWith("0."))
				answer = answer.substring(1);
			System.out.println(answer);
		}
	}

}

package cn.edu.szpku.poj;

import java.util.Iterator;
import java.util.Scanner;
import java.util.TreeMap;

public class _1002 {

	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int round = cin.nextInt();
		String inputString = "";
		String standardTelephoneNumber = "";
		TreeMap<String,Integer> tm = new TreeMap<String,Integer>();
		
		for(int i=0;i<round;i++){
			StringBuffer sb = new StringBuffer();
			inputString = cin.next();
			char[] input_array = inputString.toCharArray();
			for(int j=0;j<input_array.length;j++){
				switch(input_array[j]){
				case 'A': case 'B': case 'C':
					sb.append('2');
					break;
				case 'D': case 'E': case 'F':
					sb.append('3');
					break;
				case 'G': case 'H': case 'I':
					sb.append('4');
					break;
				case 'J': case 'K': case 'L':
					sb.append('5');
					break;
				case 'M': case 'N': case 'O':
					sb.append('6');
					break;
				case 'P': case 'R': case 'S':
					sb.append('7');
					break;
				case 'T': case 'U': case 'V':
					sb.append('8');
					break;
				case 'W': case 'X': case 'Y':
					sb.append('9');
					break;
				case '-': 
					break;
				default:
					sb.append(input_array[j]);
					break;
				}
			}
			standardTelephoneNumber = sb.insert(3, "-").toString();
			if(tm.containsKey(standardTelephoneNumber)){
				Integer value = tm.get(standardTelephoneNumber);
				tm.put(standardTelephoneNumber, ++value);
			}else{
				tm.put(standardTelephoneNumber, 1);
			}
		}
		
		Iterator<String> iter = tm.keySet().iterator();
		boolean flag = false;
		while(iter.hasNext()){
			String key = iter.next();
			int value = tm.get(key);
			if(value != 1){
				System.out.println(key + " " + value);
				flag = true;
			}
		}
		if(flag == false){
			System.out.println("No duplicates.");
		}
		
		
	}
}

package cn.edu.szpku.poj;

import java.util.Scanner;

public class _1003 {
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		float input = 0f;

		while(cin.hasNextFloat()){
			int basicN = 2;
			float sum = 0f;
			float preSum = 0f;
			
			
			input = cin.nextFloat();
			if(input <= 0.00){
				break;
			}
			else if(input <= 0.5 && input > 0.00){
				System.out.println("1 card(s)");
			}
			else{
				for(;;){
					sum += 1.0 / basicN;
					if(input - sum <= 0.00 && input - preSum > 0.00){
						System.out.println(basicN-1 + " card(s)");
						break;
					}
					++basicN;
					preSum = sum;
				}
			}
		}
	}
}

package cn.edu.szpku.poj;

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

public class _1004 {
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		float input = 0f;
		float sum = 0f;
		for(int i=0;i<12;i++){
			input = cin.nextFloat();
			sum += input;
		}
		DecimalFormat df = new DecimalFormat("#.00");
		String output = df.format(sum / 12);
		System.out.println("$"+output);
	}
}

package cn.edu.szpku.poj;

import java.util.Scanner;

public class _1005 {

	public static double calculateSqure(double x,double y){
		double result = Math.PI * (x * x + y * y) / 2;
		return result;
		
	}
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int n = 0;
		n = cin.nextInt();
		
		double X=0,Y=0;
		int year = 0;
		int num = 0;
		for(int i=0;i<n;i++){
			X = cin.nextDouble();
			Y = cin.nextDouble();
			//year = (int)(pku1005.calculateSqure(X, Y) / 50) + 1;
			year = (int)Math.ceil(calculateSqure(X, Y) / 50);
			System.out.println("Property "+ ++num +": This property will begin eroding in year "+year+".");
		}
		System.out.println("END OF OUTPUT.");
		
	}
}

package cn.edu.szpku.poj;

import java.util.Scanner;

public class _1006 {
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);

		int p = 0, e = 0, i = 0, d = 0;
		int count = 0;
		while (cin.hasNextInt()) {
			p = cin.nextInt();
			e = cin.nextInt();
			i = cin.nextInt();
			d = cin.nextInt();
			if (p == -1 && e == -1 && i == -1 && d == -1) {
				break;
			}
			int result = (5544 * p + 14421 * e + 1288 * i - d + 21252) % 21252;

			if (result == 0) {
				result = 21252;
			}
			System.out.println("Case " + ++count
					+ ": the next triple peak occurs in " + result + " days.");
		}
	}
}

package cn.edu.szpku.poj;

import java.util.Scanner;

/**
 * 中国剩余定理
 * @author Yuanbo Han
 *
 */
public class _1006Util {
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		System.out.println("输入你要得到几个数据：");
		int count = 0;
		count = cin.nextInt();
		
		int maxNum = 1006;
		int result = 0;
		//由于是pku的1006题目出来的想法，所以我暂时将最大的数据定为1006
		//NUMS 是周期的数     MODS是余数.然后将分别输出NUMS[i]对应的数据
		
		System.out.println("请分别输入你的数据：");
		int[] NUMS = new int[count];
		for(int i=0;i<count;i++){
			NUMS[i] = cin.nextInt();
		}
		
		
		for(int j=0;j<count;j++){
			int tempSum = 1;
			for(int k=0;k<count;k++){
				if(k != j){
					tempSum *= NUMS[k];
				}
			}
			for(int k=1;k<=maxNum;k++){
				result = tempSum * k;
				if(result % NUMS[j] == 1){
					break;
				}
			}
			System.out.println(NUMS[j]+"对应的数据是:  "+result);
		}
		System.out.println("得到相应的数据之后,根据将所有的   NUMS[i] * MODS[i]相加,\n然后mod 所有的NUMS[i]相乘就得到了解");
	}
}

package cn.edu.szpku.poj;

import java.util.Scanner;

public class _1007 {
	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int characterNum = 0;
		int count = 0;
		characterNum = cin.nextInt();
		count = cin.nextInt();
		
		int index = 0;
		String[] input = new String[count];
		int[] sumForEveryString = new int[count];
		
		while(cin.hasNext()){
			input[index] = cin.next();
			char[] tempChar = input[index].toCharArray();
			
			int tempSum = 0;
			for(int i=0;i<characterNum;i++){
				for(int j=i+1;j<characterNum;j++){
					if(tempChar[i] > tempChar[j]){
						++tempSum;
					}
				}
			}
			
			
			sumForEveryString[index] = tempSum;
			++index;
			if(index >= count){
				break;
			}
		}
		
		
		
		for(int i=0;i<count;i++){
			int outputIndex = 0;//输出后将此位置设置为10000
			for(int j=0;j<count;j++){
				if(sumForEveryString[j] < sumForEveryString[outputIndex]){
					outputIndex = j;
				}
			}
			System.out.println(input[outputIndex]);
			sumForEveryString[outputIndex] = 10000;
		}
	}
}

package cn.edu.szpku.poj;

import java.util.Scanner;

public class _1008 {

	// 将19个月转换成整型数值
	public static int convertMonthStringToInteger_Haab(String str) {
		int value = 0;
		if (str.equals("pop"))
			value = 1;
		else if (str.equals("no"))
			value = 2;
		else if (str.equals("zip"))
			value = 3;
		else if (str.equals("zotz"))
			value = 4;
		else if (str.equals("tzec"))
			value = 5;
		else if (str.equals("xul"))
			value = 6;
		else if (str.equals("yoxkin"))
			value = 7;
		else if (str.equals("mol"))
			value = 8;
		else if (str.equals("chen"))
			value = 9;
		else if (str.equals("yax"))
			value = 10;
		else if (str.equals("zac"))
			value = 11;
		else if (str.equals("ceh"))
			value = 12;
		else if (str.equals("mac"))
			value = 13;
		else if (str.equals("kankin"))
			value = 14;
		else if (str.equals("muan"))
			value = 15;
		else if (str.equals("pax"))
			value = 16;
		else if (str.equals("koyab"))
			value = 17;
		else if (str.equals("cumhu"))
			value = 18;
		else
			value = 19;
		return value;
	}

	// 将给定的月份转换成月份的名字
	public static String convertMonthIntegerToString_Tzolkin(int month) {
		String str = "";
		
		if (month == 1)
			str = "imix";
		else if (month == 2)
			str = "ik";
		else if (month == 3)
			str = "akbal";
		else if (month == 4)
			str = "kan";
		else if (month == 5)
			str = "chicchan";
		else if (month == 6)
			str = "cimi";
		else if (month == 7)
			str = "manik";
		else if (month == 8)
			str = "lamat";
		else if (month == 9)
			str = "muluk";
		else if (month == 10)
			str = "ok";
		else if (month == 11)
			str = "chuen";
		else if (month == 12)
			str = "eb";
		else if (month == 13)
			str = "ben";
		else if (month == 14)
			str = "ix";
		else if (month == 15)
			str = "mem";
		else if (month == 16)
			str = "cib";
		else if (month == 17)
			str = "caban";
		else if (month == 18)
			str = "eznab";
		else if (month == 19)
			str = "canac";
		else if (month == 20)
			str = "ahau";

		return str;
	}

	public static int totalDay_Haab(int year, int month, int day) {
		// 一年365天 每个月20天 共19个月 第19个月5天
		// 第一天从 0. 1 0 开始 0. pop 0 (日. 月 年)
		int totalDay = 0;

		totalDay += year * 365;
		totalDay += (month - 1) * 20;
		totalDay += day + 1;

		return totalDay;
	}

	public static int getNum_Tzolkin(int totalDay_Haab) {
		int num_Tzolkin = (totalDay_Haab - getYear_Tzolkin(totalDay_Haab) * 260) % 13;
		if (num_Tzolkin == 0) {
			num_Tzolkin = 13;
		}
		return num_Tzolkin;
	}

	public static int getName_Tzolkin(int totalDay_Haab) {
		int name_Tzolkin = 0;
		name_Tzolkin = (totalDay_Haab - getYear_Tzolkin(totalDay_Haab) * 260) % 20;
		if (name_Tzolkin == 0) {
			name_Tzolkin = 20;
		}
		return name_Tzolkin;
	}

	public static int getYear_Tzolkin(int totalDay_Haab) {
		int year_Tzolkin = (totalDay_Haab - 1) / 260;
		return year_Tzolkin;
	}

	public static void main(String[] args) {
		Scanner cin = new Scanner(System.in);
		int num = cin.nextInt();
		System.out.println(num);
		for (int i = 0; i < num; i++) {
			String temp1 = cin.next();
			String temp2 = cin.next();
			int yearHaab = cin.nextInt();
			int dayHaab = Integer.parseInt(temp1.substring(0, temp1.length() - 1));
			int monthHaab = convertMonthStringToInteger_Haab(temp2);
			
			int totalDayHaab = totalDay_Haab(yearHaab, monthHaab, dayHaab);

			int yearTzolkin = getYear_Tzolkin(totalDayHaab);
			int intNameTzolkin = getName_Tzolkin(totalDayHaab);
			int numTzolkin = getNum_Tzolkin(totalDayHaab);
			String strNameTzolkin = convertMonthIntegerToString_Tzolkin(intNameTzolkin);

			System.out.println(numTzolkin + " " + strNameTzolkin + " " + yearTzolkin);
		}
	}
}

分享到：