From d06c8eb80942da72f1be96b55120dd291c3bc5e0 Mon Sep 17 00:00:00 2001 From: KYOSG <57186704+KYOSG@users.noreply.github.com> Date: Sat, 8 May 2021 19:13:12 +0800 Subject: [PATCH] 5.8.2 --- .DS_Store | Bin 8196 -> 8196 bytes Java Experiments/.DS_Store | Bin 0 -> 6148 bytes Java Experiments/A/.DS_Store | Bin 0 -> 6148 bytes Java Experiments/A/A+B Problem.java | 14 +++++ .../A/A+B for Input-Output Practice (I).java | 18 +++++++ .../A+B for Input-Output Practice (III).java | 21 ++++++++ .../A/A+B for Input-Output Practice (IV).java | 27 ++++++++++ .../A/A+B for Input-Output Practice (V).java | 30 +++++++++++ .../A/A+B for Input-Output Practice (VI).java | 25 +++++++++ .../A+B for Input-Output Practice (VII).java | 19 +++++++ .../A/A+B for Input-Output Practice.java | 51 ++++++++++++++++++ Java Experiments/A/Hello World!.java | 7 +++ .../A/格式化输出(常量练习).java | 34 ++++++++++++ Java Experiments/A/洗衣服.java | 31 +++++++++++ Java Experiments/A/火车.java | 31 +++++++++++ Java Experiments/A/逆置正整数.java | 34 ++++++++++++ 16 files changed, 342 insertions(+) create mode 100644 Java Experiments/.DS_Store create mode 100644 Java Experiments/A/.DS_Store create mode 100644 Java Experiments/A/A+B Problem.java create mode 100644 Java Experiments/A/A+B for Input-Output Practice (I).java create mode 100644 Java Experiments/A/A+B for Input-Output Practice (III).java create mode 100644 Java Experiments/A/A+B for Input-Output Practice (IV).java create mode 100644 Java Experiments/A/A+B for Input-Output Practice (V).java create mode 100644 Java Experiments/A/A+B for Input-Output Practice (VI).java create mode 100644 Java Experiments/A/A+B for Input-Output Practice (VII).java create mode 100644 Java Experiments/A/A+B for Input-Output Practice.java create mode 100644 Java Experiments/A/Hello World!.java create mode 100644 Java Experiments/A/格式化输出(常量练习).java create mode 100644 Java Experiments/A/洗衣服.java create mode 100644 Java Experiments/A/火车.java create mode 100644 Java Experiments/A/逆置正整数.java diff --git a/.DS_Store b/.DS_Store index 64c46c9c0e453ec03f53191195fb51918936d45a..d2ae65f2fc69c2d322583850ed5a5df26ee855a8 100644 GIT binary patch delta 652 zcmZp1XmOa}&nUJrU^hRb*yIg@Dw_=iCNn1rFnBQ}GL!+a0)s0<1w#QtDnk)NCPOZe z&SNNHDE7?BPfp6oPhwzT5MW?noC&0D{zCy+jDY^h1p+tg38=|QHw;eB&n*C&2LlA% zm7DM40(BQh>+E}nE*@* B4u${# diff --git a/Java Experiments/.DS_Store b/Java Experiments/.DS_Store new file mode 100644 index 0000000000000000000000000000000000000000..b5258aae94737c2b1a2602e2e00fa5bf4ce1515e GIT binary patch literal 6148 zcmeHK!AiqG5Z$d+Hx#i4L63X!R-_FIdJxj82X8_|4=OdWMFTM_ZEDe4$!F*v`3HWE z&g_mtQ7;}u$_&iB$?VLAc`3UcA%tuVIt?MJLI?$lSn|MpBe;(GMM@Nz0hG9hiNV9I znzX|3-x+Y<6-}XGG5}FH0kH{`l~F>lxOGWl~NV8pw7Z8 zGYs=6AM{&M?*yL?qWmf*|InE9(~sh#q&sX^mv&5+M@iQ0+2W+rg_P6dBviWm?U4(-ta z#*P4hWe8gV9|r)e(S!kE;Sg3pq$>qB=FlDK8)_9J+ELY50)zW=Ru@v~P#~ zwM`c?aLAS!U?gI;p#wWW4zWvI4{ngpYOM$Jbl4V>U1+J=@^~-duT^HD@ zzBgqnTPJPuz2(+P^ZUK&ic2xVl&kH&be-knH)nURla;fTEx#(+TtkzPb7OlAbGMXD z0aKt{0sTHWx?&PB3+O)`Ec_LKSZB94*7exe7#A^#m<8krO+qL!gi5?(NC;=Yi}R9* zS-=nuiI)$F%o1-X;@SCp=chxGfL59Urof^C8==|M^Z#`9{eLmYTBd+0@UIk*diSE+ zVM_6AT}n>RT1Owy)pTAK(1);y$FZ;IQM^O<#xbWAViGY6$R3*g2zVK+Fa>^9fiE%f BwM+m2 literal 0 HcmV?d00001 diff --git a/Java Experiments/A/A+B Problem.java b/Java Experiments/A/A+B Problem.java new file mode 100644 index 0000000..2d43715 --- /dev/null +++ b/Java Experiments/A/A+B Problem.java @@ -0,0 +1,14 @@ +import java.util.Scanner; + +public class Main +{ + public static void main(String [] args) + { + Scanner Data = new Scanner(System.in); + int a,b; + a=Data.nextInt(); + b= Data.nextInt(); + System.out.printf("%d",a+b); + Data.close(); + } +} \ No newline at end of file diff --git a/Java Experiments/A/A+B for Input-Output Practice (I).java b/Java Experiments/A/A+B for Input-Output Practice (I).java new file mode 100644 index 0000000..4e1b546 --- /dev/null +++ b/Java Experiments/A/A+B for Input-Output Practice (I).java @@ -0,0 +1,18 @@ +import java.util.Scanner; + +public class Main +{ + public static void main(String [] args) + { + Scanner Data = new Scanner(System.in); + int a,b; + + while(Data.hasNextInt()) + { + a=Data.nextInt(); + b=Data.nextInt(); + + System.out.printf("%d\n",a+b); + } + } +} \ No newline at end of file diff --git a/Java Experiments/A/A+B for Input-Output Practice (III).java b/Java Experiments/A/A+B for Input-Output Practice (III).java new file mode 100644 index 0000000..6cd5d86 --- /dev/null +++ b/Java Experiments/A/A+B for Input-Output Practice (III).java @@ -0,0 +1,21 @@ +import java.util.Scanner; + +public class Main +{ + public static void main(String [] args) + { + Scanner Data = new Scanner(System.in); + + int n,a,b; + + n=Data.nextInt(); + while(n!=0) + { + a=Data.nextInt(); + b=Data.nextInt(); + + System.out.printf("%d\n",a+b); + n--; + } + } +} \ No newline at end of file diff --git a/Java Experiments/A/A+B for Input-Output Practice (IV).java b/Java Experiments/A/A+B for Input-Output Practice (IV).java new file mode 100644 index 0000000..d69c63e --- /dev/null +++ b/Java Experiments/A/A+B for Input-Output Practice (IV).java @@ -0,0 +1,27 @@ +import java.util.*; + +public class Main +{ + public static void main(String [] args) + { + Scanner Data = new Scanner(System.in); + + int n,a; + int sum; + while(true) + { + sum=0; + n=Data.nextInt(); + if(n==0) + break; + + while(n!=0) + { + a=Data.nextInt(); + sum+=a; + n--; + } + System.out.printf("%d\n",sum); + } + } +} diff --git a/Java Experiments/A/A+B for Input-Output Practice (V).java b/Java Experiments/A/A+B for Input-Output Practice (V).java new file mode 100644 index 0000000..ccf2d29 --- /dev/null +++ b/Java Experiments/A/A+B for Input-Output Practice (V).java @@ -0,0 +1,30 @@ +import java.util.*; + +public class Main +{ + public static void main(String [] args) + { + Scanner Data = new Scanner(System.in); + + int n, a; + int sum; + + int N; + + N=Data.nextInt(); + + while(N!=0) + { + sum=0; + n=Data.nextInt(); + while(n!=0) + { + a=Data.nextInt(); + sum+=a; + n--; + } + System.out.printf("%d\n",sum); + N--; + } + } +} diff --git a/Java Experiments/A/A+B for Input-Output Practice (VI).java b/Java Experiments/A/A+B for Input-Output Practice (VI).java new file mode 100644 index 0000000..900b761 --- /dev/null +++ b/Java Experiments/A/A+B for Input-Output Practice (VI).java @@ -0,0 +1,25 @@ +import java.util.Scanner; + +public class Main +{ + public static void main(String [] args) + { + Scanner Data = new Scanner(System.in); + + int n, a; + int sum; + + while(Data.hasNextInt()) + { + sum=0; + n=Data.nextInt(); + while(n!=0) + { + a=Data.nextInt(); + sum+=a; + n--; + } + System.out.printf("%d\n",sum); + } + } +} diff --git a/Java Experiments/A/A+B for Input-Output Practice (VII).java b/Java Experiments/A/A+B for Input-Output Practice (VII).java new file mode 100644 index 0000000..9c6cf17 --- /dev/null +++ b/Java Experiments/A/A+B for Input-Output Practice (VII).java @@ -0,0 +1,19 @@ +import java.util.Scanner; + +public class Main +{ + public static void main(String [] args) + { + Scanner Data = new Scanner(System.in); + + int a,b; + + while(Data.hasNextInt()) + { + a=Data.nextInt(); + b=Data.nextInt(); + + System.out.printf("%d\n\n",a+b); + } + } +} \ No newline at end of file diff --git a/Java Experiments/A/A+B for Input-Output Practice.java b/Java Experiments/A/A+B for Input-Output Practice.java new file mode 100644 index 0000000..9830ca0 --- /dev/null +++ b/Java Experiments/A/A+B for Input-Output Practice.java @@ -0,0 +1,51 @@ +/* +Input +Input contains an integer N in the first line, and then N lines follow. Each line starts with a integer M, and then M integers follow in the same line +Output +For each group of input integers you should output their sum in one line, and you must note that there is a blank line between outputs. +Sample +Input +3 +4 1 2 3 4 +5 1 2 3 4 5 +3 1 2 3 +Output +10 + +15 + +6 + */ + +import java.util.Scanner; + +public class Main +{ + public static void main(String[] args) + { + Scanner in = new Scanner(System.in); + + int N; + N = in.nextInt(); + + int M; + int sum; + int t; + + while(N>0) + { + sum=0; + M=in.nextInt(); + while(M>0) + { + t=in.nextInt(); + sum+=t; + M--; + } + System.out.printf("%d\n\n",sum); + N--; + } + + + } +} \ No newline at end of file diff --git a/Java Experiments/A/Hello World!.java b/Java Experiments/A/Hello World!.java new file mode 100644 index 0000000..3d63fdb --- /dev/null +++ b/Java Experiments/A/Hello World!.java @@ -0,0 +1,7 @@ +public class Main +{ + public static void main(String [] args) + { + System.out.print("Hello World!\n"); + } +} \ No newline at end of file diff --git a/Java Experiments/A/格式化输出(常量练习).java b/Java Experiments/A/格式化输出(常量练习).java new file mode 100644 index 0000000..d781462 --- /dev/null +++ b/Java Experiments/A/格式化输出(常量练习).java @@ -0,0 +1,34 @@ +/* +Description +用c语言的基本输出格式打印下列内容: +100 +A +3.140000 + +Input +本题目没有输入数据 + +Output +输出三行数据: +100 +A +3.140000 + +Sample +Output +100 +A +3.140000 +*/ +public class Main +{ + public static void main(String [] args) + { + int a=100; + char c='A'; + double f=3.140000; + System.out.printf("%d\n",a); + System.out.printf("%c\n",c); + System.out.printf("%f\n",f); + } +} \ No newline at end of file diff --git a/Java Experiments/A/洗衣服.java b/Java Experiments/A/洗衣服.java new file mode 100644 index 0000000..125c1ca --- /dev/null +++ b/Java Experiments/A/洗衣服.java @@ -0,0 +1,31 @@ +/* +Description +X是一个勤劳的小孩,总是会帮助大人做家务。现在他想知道对于一根长为L的绳子能晾开多少件宽为W的衣服,显然这些衣服不能相互叠压。 +Input + 多组输入。 +每组输入两个整数L,W。 +Output + 输出答案。 +Sample +Input +10 5 +10 4 +Output +2 +2 + */ +import java.util.Scanner; +public class Main +{ + public static void main(String [] args) + { + Scanner in = new Scanner(System.in); + int L,W; + while(in.hasNextInt()) + { + L=in.nextInt(); + W=in.nextInt(); + System.out.printf("%d\n",L/W); + } + } +} \ No newline at end of file diff --git a/Java Experiments/A/火车.java b/Java Experiments/A/火车.java new file mode 100644 index 0000000..ca1412d --- /dev/null +++ b/Java Experiments/A/火车.java @@ -0,0 +1,31 @@ +import java.util.Scanner; + +public class Main +{ + public static void main(String [] args) + { + int T,n,a,b; + int max,temp; + Scanner in =new Scanner(System.in); + T=in.nextInt(); + + while(T!=0) + { + max=0; + temp=0; + n=in.nextInt(); + while(n!=0) + { + a=in.nextInt(); + b=in.nextInt(); + temp=temp-a+b; + if(max