试验GPT写代码两例

写一个HeLLo WOrLd的Java代码

java复制代码

public class HelloWorld {
    
     
    public static void main(String[] args) {
    
     
        System.out.println("Hello World!"); 
    } 
} 

写一段验证100内哥德巴赫猜想的Java代码
执行结果如下所示：

4 = 2 + 2
6 = 3 + 3
8 = 3 + 5
10 = 3 + 7
12 = 5 + 7
14 = 3 + 11
16 = 3 + 13
18 = 5 + 13
20 = 3 + 17
22 = 3 + 19
24 = 5 + 19
26 = 3 + 23
28 = 5 + 23
30 = 7 + 23
32 = 3 + 29
34 = 3 + 31
36 = 5 + 31
38 = 7 + 31
40 = 3 + 37
42 = 5 + 37
44 = 3 + 41
46 = 3 + 43
48 = 5 + 43
50 = 3 + 47
52 = 5 + 47
54 = 7 + 47
56 = 3 + 53
58 = 5 + 53
60 = 7 + 53
62 = 3 + 59
64 = 3 + 61
66 = 5 + 61
68 = 7 + 61
70 = 3 + 67
72 = 5 + 67
74 = 3 + 71
76 = 3 + 73
78 = 5 + 73
80 = 7 + 73
82 = 3 + 79
84 = 5 + 79
86 = 3 + 83
88 = 5 + 83
90 = 7 + 83
92 = 3 + 89
94 = 5 + 89
96 = 7 + 89
98 = 19 + 79
100 = 3 + 97

进程已结束,退出代码0

下面是一段Java代码，用于验证100内的哥德巴赫猜想，即对于每个大于2的偶数，都可以写成两个质数之和。

public class GoldbachConjecture {
    
     
    public static void main(String[] args) {
    
     
        int limit = 100; 
        boolean[] isPrime = new boolean[limit + 1]; 
        // 初始化isPrime数组 
        for (int i = 2; i <= limit; i++) {
    
     
            isPrime[i] = true; 
        } 
        // 找出所有质数 
        for (int i = 2; i * i <= limit; i++) {
    
     
           if (isPrime[i]) {
    
     
               for (int j = i * i; j <= limit; j += i)   {
    
    
                   isPrime[j] = false; 
               }
           } 
       } 
       // 检验哥德巴赫猜想 
       for (int i = 4; i <= limit; i += 2) {
    
    
          boolean found = false; 
          for (int j = 2; j <= i / 2; j++) {
    
     
              if (isPrime[j] && isPrime[i - j]) {
    
     
                  found = true; System.out.printf("%d = %d + %d\n", i, j, i - j); 
                  break; 
               } 
          } 
          if (!found) {
    
     System.out.println("Goldbach Conjecture is false."); }
       } 
  }
} 

这段代码利用了一个布尔数组isPrime来记录每个数字是否为质数，然后使用嵌套的循环遍历所有可能的相加组合，找出两个质数加起来等于目标数字。如果没有找到合适的组合，则说明哥德巴赫猜想不成立。

—the—end—