From 84823d456c879b971f61ed5a906d87f3aada1404 Mon Sep 17 00:00:00 2001
From: BIT <BIT@DESKTOP-9NKNPSR>
Date: Thu, 27 Dec 2018 16:33:44 +0900
Subject: [PATCH] practice02

---
 src/practice02/Prob01.java | 13 ++++++++++
 src/practice02/Prob02.java | 16 ++++++++++++
 src/practice02/Prob03.java | 36 ++++++++++++++++----------
 src/practice02/Prob04.java |  9 +++++++
 src/practice02/Prob05.java | 53 +++++++++++++++++++++++++++++++++++++-
 5 files changed, 113 insertions(+), 14 deletions(-)

diff --git a/src/practice02/Prob01.java b/src/practice02/Prob01.java
index 8dbc760..0335aab 100644
--- a/src/practice02/Prob01.java
+++ b/src/practice02/Prob01.java
@@ -1,9 +1,22 @@
 package practice02;
 
+import java.util.Scanner;
+
 public class Prob01 {
 
 	public static void main(String[] args) {
 		final int[] MONEYS = { 50000, 10000, 5000, 1000, 500, 100, 50, 10, 5, 1 };
+		Scanner s = new Scanner(System.in);
+		System.out.print("금액: ");
+		int money = s.nextInt();
+		
+		System.out.println();
+		for(int i = 0 ; i < MONEYS.length; i++) {
+			System.out.print(MONEYS[i]+"원 : " );
+			System.out.println(money/MONEYS[i]+"개");
+			money = money%MONEYS[i];
+		}
+		
 	}
 
 }
diff --git a/src/practice02/Prob02.java b/src/practice02/Prob02.java
index 83548be..b3e8570 100644
--- a/src/practice02/Prob02.java
+++ b/src/practice02/Prob02.java
@@ -1,8 +1,24 @@
 package practice02;
 
+import java.util.Scanner;
+
 public class Prob02 {
 
 	public static void main(String[] args) {
+		Scanner in = new Scanner( System.in );
+        int intArray[] = new int[5];
+        double sum = 0;
+        System.out.println("5개의 숫자를 입력하세요.");
+        /* 키보드에서 배열 크기만큼 입력 받아 배열에 저장하는 코드 */
+        for(int i = 0 ; i < intArray.length ; i++) {
+        	intArray[i] = in.nextInt();
+        
+        /* 배열에 저장된 정수 값 더하기 */
+        	sum += intArray[i];
+        }	
+        /* 출력 */
+        System.out.println("평균은 "+sum/intArray.length+" 입니다.");
+		
 	}
 
 }
diff --git a/src/practice02/Prob03.java b/src/practice02/Prob03.java
index c56a9e4..bea7604 100644
--- a/src/practice02/Prob03.java
+++ b/src/practice02/Prob03.java
@@ -1,18 +1,28 @@
-package practice02;
 
-public class Prob03 {
+  package practice02;
+  
+  public class Prob03 {
 
-	public static void main(String args[]) {
-		char c[] = { 'T', 'h', 'i', 's', ' ', 'i', 's', ' ', 'a', ' ', 'p', 'e', 'n', 'c', 'i', 'l', '.' };
+	   public static void main (String args[]) {
+	     char c[] = {'T','h','i','s',' ','i','s',' ','a',' ','p','e','n','c','i','l','.'};
+	     printCharArray(c);  // 원래 배열 원소 출력
+	     replaceSpace(c);    // 공백 문자 바꾸기
+	     printCharArray(c);  // 수정된 배열 원소 출력
+	   }
 
-		// 원래 배열 원소 출력
-		printCharArray(c);
-
-		// 공백 문자 바꾸기
-		replaceSpace(c);
+	public static void replaceSpace(char a[]) {
+		for(int i = 0 ; i < a.length ; i ++) {
+			if(a[i] == ' ') {
+				a[i] = ',';
+			}
+		}
+	}
+	   
+	   public static void printCharArray(char a[]) {
+		   for(int i = 0 ; i < a.length ; i++) {
+			   System.out.print(a[i]);
+		   }
+		   System.out.println();
+	   }
 
-		// 수정된 배열 원소 출력
-		printCharArray(c);
 	}
-	
-}
diff --git a/src/practice02/Prob04.java b/src/practice02/Prob04.java
index 4e36d34..05d9601 100644
--- a/src/practice02/Prob04.java
+++ b/src/practice02/Prob04.java
@@ -12,9 +12,18 @@ public static void main(String[] args) {
 	
 	public static char[] reverse(String str) {
 		/* 코드를 완성합니다 */
+		char[] tmp = new char[str.length()];
+		for(int i = 0 ; i< str.length(); i++) {
+			tmp[i] = str.charAt(str.length()-1-i);
+		}
+		return tmp;
 	}
 
 	public static void printCharArray(char[] array){
 		/* 코드를 완성합니다 */
+		for(int i = 0; i < array.length; i++) {
+			System.out.print(array[i]);
+		}
+		System.out.println();
 	}
 }
diff --git a/src/practice02/Prob05.java b/src/practice02/Prob05.java
index 0e54b0f..0edc3b7 100644
--- a/src/practice02/Prob05.java
+++ b/src/practice02/Prob05.java
@@ -1,10 +1,61 @@
 package practice02;
 
-public class Prob05 {
+import java.util.Random;
+import java.util.Scanner;
 
+public class Prob05 {
 
 	public static void main(String[] args) {
+		Random r = new Random();
+		Scanner s = new Scanner(System.in);
+		int start;
+		int end;
+		int n;
+		int check;
+		int k;
+		boolean endGame;
+		
+		
+		
+		while(true) {
+		start = 1;
+		end = 100;
+		n = 1;
+		k = r.nextInt(100) + 1;
+		endGame =true;
+		System.out.println("수를 결정하였습니다. 맞추어 보세요");
+		while (endGame) {
+			System.out.println(start + "-" + end);
+			System.out.print(n++ + ">>");
+			check = s.nextInt();
 
+			if (check == k) {
+				System.out.println("맞았습니다.");
+				endGame = false;
+			} else if (check > k) {
+				System.out.println("더 낮게");
+				end = check;
+			} else if (check < k) {
+				System.out.println("더 높게");
+				start = check;
+			}
+		}
+		
+		
+		
+		
+		System.out.print("다시하시겠습니까(y/n)>>");
+		String answer = s.next();
+		if(answer.equals("y")) {
+			
+		}else if(answer.equals("n")) {
+			break;
+		}
+		
+		
+		
+		
 	}
 
 }
+}