ChatGPT 쩌네요.

Question

인공지능이 어느정도까지 발전했는지 심심해서 확인해보니.. 와 진짜 쩌네요.한 5년만 더 개발되어도 이제 프로그래밍하기 더 쉬워질... 아니 어쩌면 아무나 프로그래밍할 수 있는 시대가 되지 않을까 하는 생각도 드네요-_-;박준에 있는 문제를 AI한테 던졌어요.The first line is given the number of data to be entered and the amount to be created. The type of coin is given from the second line. When you try to make the amount in the first line by combining the types of coins given, Make the program Java code to find the minimum number of coins. Enter an example 10 4200 1 5 10 50 100 500 1000 5000 10000 50000 Example Output 6ChatGPT 답변 : Here's an example of a Java program that solves the problem you described:Copy codeimport java.util.Scanner; public class CoinChange { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int totalAmount = sc.nextInt(); int targetAmount = sc.nextInt(); int[] coins = new int[totalAmount]; for (int i = 0; i < totalAmount; i++) { coins[i] = sc.nextInt(); } int[] dp = new int[targetAmount + 1]; for (int i = 1; i <= targetAmount; i++) { dp[i] = Integer.MAX_VALUE; } for (int i = 1; i <= targetAmount; i++) { for (int j = 0; j < totalAmount; j++) { if (coins[j] <= i) { int sub_res = dp[i - coins[j]]; if (sub_res != Integer.MAX_VALUE && sub_res + 1 < dp[i]) { dp[i] = sub_res + 1; } } } } System.out.println(dp[targetAmount]); } } This program uses dynamic programming to find the minimum number of coins needed to make the target amount using the types of coins provided. It takes input of total number of coin type, target amount and the coin values. Then it uses dp algorithm to find the minimum number of coin needed to make the target amount.프로그래밍 속도 개선 요청 :Wow your code is good. But could you change the code so that the result can be printed out faster?ChatGPT 답변 : Here's one way to optimize the code to make it run faster:Copy codeimport java.util.Scanner; public class CoinChange { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int totalAmount = sc.nextInt(); int targetAmount = sc.nextInt(); int[] coins = new int[totalAmount]; for (int i = 0; i < totalAmount; i++) { coins[i] = sc.nextInt(); } int[] dp = new int[targetAmount + 1]; for (int i = 1; i <= targetAmount; i++) { dp[i] = Integer.MAX_VALUE; } for (int j = 0; j < totalAmount; j++) { for (int i = coins[j]; i <= targetAmount; i++) { dp[i] = Math.min(dp[i], dp[i - coins[j]] + 1); } } System.out.println(dp[targetAmount]); } } This version of the program uses the same dynamic programming approach as before but with a slightly different order of nested loops. By reversing the order of the loops, we can avoid unnecessary computation. It will check the coin values from the minimum coin value to target amount and update the dp array which will make the program faster.Additionally, you can try to use a more efficient data structure for storing the coin values and dp array, like an ArrayList instead of an array, if you're working with large inputs and that should also help you to improve the performance.내가 만든 코드가 더 좋은 것 같다고 말해봤습니다.I think the code I made is better than your code, what do you think?import java.util.Scanner; public class CoinChange { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int iCnt = sc.nextInt(); int iTarget = sc.nextInt(); int iCoinCnt = 0; int[] coins = new int[iCnt]; for(int i = 0; i < iCnt; i++) { coins[i] = sc.nextInt(); } for(int i = iCnt - 1; i >= 0; i--) { int iQ = iTarget / coins[i]; if (iQ > 0) { iCoinCnt = iCoinCnt + iQ; iTarget = iTarget % coins[i]; if (iTarget == 0) break; } } System.out.println(iCoinCnt); } }ChatGPT 답변 : 그리디 알고리즘을 쓴 걸로 보이는데 오류가 있다.Your code is also solving the same problem but in a different way. It uses greedy algorithm approach where it takes the largest coin denomination first and then takes the remainder and move to the next largest denomination. This approach will give the correct result in most cases but not always, as it may not always give the minimum number of coin.For example, if you have a target of 11 and coins: [1,3,5] and you want the minimum number of coin. The greedy algorithm will give 3 coin of denomination 5 and 1 coin of denomination 1, whereas the optimal solution is 2 coin of denomination 5 and 1 coin of denomination 1. So in cases like this, your code will give wrong answer and my previous code will give the correct answer.Both the codes will have similar performance for large inputs, but the dynamic programming approach is more flexible and can be applied to more general cases.아무래도 ChatGPT가 잘못 생각한 거 같아서 재 질의합니다.You seem to think something wrong. To make 11 with coins of 1, 3, 5, we need 2 coins of 5 and 1 coin of 1, so my code outputs the correct answer 3.ChatGPT가 자신이 잘못 생각했다고 인정하고 죄송하다고 하네요-0-;;;You are correct, I apologize for the mistake in my previous response. Your code does indeed find the correct minimum number of coins needed to make the target amount using the greedy algorithm approach. My apologies for any confusion caused.Your code approach is simple, easy to implement and also efficient and will give correct answer as long as the coin denominations are in descending order, which is the case in your example.Both the approaches have their own advantages and disadvantages, it depends on the requirements of the problem and the constraints you have.AI가 생각보다 대단한 영역까지 인간을 대체할 수도 있을 것 같습니다.

jk.son · Answer

okky에 이미 chatGPT 관련 글들이 많네요. 저만 지금에야 놀란듯 ㅋㅋ

공지사항 · Answer

근데 백준에 있는 그 문제 이미 인터넷상에 올려진 코드는 아닌가요? 아니면 대단하긴하네요

OKKY_OP2 · Answer

해당 게시물은 관리자에 의해 리뷰에서 기타로 이동 되었습니다.

ChatGPT 쩌네요.

3개의 답변

Q&A 목록