P5733題目要求

P5733題目鏈接

P5733分析

toUpperCase()就行了……

P5733AC代碼（Java語言描述）

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner scanner = new Scanner(System.in);String str = scanner.nextLine();String str2 = str.toUpperCase();System.out.println(str2);scanner.close();} }

P5734題目要求

P5734題目鏈接

P5734分析

為每個命令編寫自己的函數，按要求實現即可……

P5734AC代碼（Java語言描述）

import java.util.Scanner;public class Main {private static String doc = "";private static void append(String append_doc) {doc = doc + append_doc;}private static void cut(int from, int range) {doc = doc.substring(from, from+range);}private static void insert(int from, String insert_doc) {String head = doc.substring(0, from);String rear = doc.substring(from);doc = head + insert_doc + rear;}private static int search(String search_key) {return doc.indexOf(search_key);}private static String getResult(String command) {String[] arr = command.split(" ");if (command.startsWith("1")) {append(arr[1]);return doc;} else if (command.startsWith("2")) {cut(Integer.parseInt(arr[1]), Integer.parseInt(arr[2]));return doc;} else if (command.startsWith("3")) {insert(Integer.parseInt(arr[1]), arr[2]);return doc;} else {return Integer.toString(search(arr[1]));}}public static void main(String[] args) {Scanner scanner = new Scanner(System.in);int num = Integer.parseInt(scanner.nextLine());doc = scanner.nextLine();String[] result = new String[num];for (int i = 0; i < num; i++) {result[i] = getResult(scanner.nextLine());}scanner.close();for (String s : result) {System.out.println(s);}}}

P5735題目要求

P5735題目鏈接

P5735分析

C = a + b + c 嘛，每條邊長就作差平方開根，大家都懂的OK……

P5735AC代碼（Java語言描述）

import java.util.Scanner;public class Main {public static void main(String[] args) {Scanner scanner = new Scanner(System.in);double x1 = scanner.nextDouble(), y1 = scanner.nextDouble(), x2 = scanner.nextDouble(),y2 = scanner.nextDouble(), x3 = scanner.nextDouble(), y3 = scanner.nextDouble();double l1 = Math.sqrt(Math.pow(x2-x1, 2) + Math.pow(y2-y1, 2));double l2 = Math.sqrt(Math.pow(x3-x2, 2) + Math.pow(y3-y2, 2));double l3 = Math.sqrt(Math.pow(x3-x1, 2) + Math.pow(y3-y1, 2));System.out.printf("%.2f", l1+l2+l3);scanner.close();} }

P5739題目要求

P5739題目鏈接

P5739分析

不循環，那就是遞歸，寫個遞歸的階乘很水的啦……

P5739AC代碼（Java語言描述）

import java.math.BigInteger; import java.util.Scanner;public class Main {private static BigInteger calculate_factorial(BigInteger num, BigInteger result) {if (num.equals(new BigInteger("0"))) {return new BigInteger("1");} else if (num.equals(new BigInteger("1"))) {return result;} else {result = result.multiply(num);return calculate_factorial(num.subtract(new BigInteger("1")), result);}}public static void main(String[] args) {Scanner scanner = new Scanner(System.in);BigInteger limit = new BigInteger(scanner.next());scanner.close();System.out.println(calculate_factorial(limit, new BigInteger("1")));}} 創作挑戰賽新人創作獎勵來咯，堅持創作打卡瓜分現金大獎

總結

以上是生活随笔為你收集整理的洛谷P5733、P5734、P5735、P5739题题解（Java语言描述）的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。