add Problem10

realDuYuanChao · realDuYuanChao · commit d4f0eed4dcf2 · 2020-10-05T16:29:28.000+08:00
diff --git a/src/main/java/com/examplehub/projecteuler/Problem06.java b/src/main/java/com/examplehub/projecteuler/Problem06.java
@@ -16,7 +16,7 @@ public class Problem06 {
     public static long solution1(int n) {
         long sumOfSquares = 0;
         for (int i = 1; i <= n; ++i) {
-            sumOfSquares += Math.pow(i, 2);
+            sumOfSquares  = (long) (sumOfSquares + Math.pow(i, 2));
         }
 
         long squareOfSum = (long) Math.pow(SumToN.sum(n), 2);
diff --git a/src/main/java/com/examplehub/projecteuler/Problem10.java b/src/main/java/com/examplehub/projecteuler/Problem10.java
@@ -1,5 +1,7 @@
 package com.examplehub.projecteuler;
 
+import com.examplehub.maths.PrimeCheck;
+
 /**
  * The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
  * <p>
@@ -10,5 +12,11 @@
 public class Problem10 {
     public static long solution1(int n) {
         long sum = 0;
+        for (int i = 2; i <= n; i++) {
+            if (PrimeCheck.isPrime(i)) {
+                sum += i;
+            }
+        }
+        return sum;
     }
 }
diff --git a/src/test/java/com/examplehub/projecteuler/Problem10Test.java b/src/test/java/com/examplehub/projecteuler/Problem10Test.java
@@ -0,0 +1,14 @@
+package com.examplehub.projecteuler;
+
+import org.junit.jupiter.api.Test;
+
+import static org.junit.jupiter.api.Assertions.*;
+
+class Problem10Test {
+
+    @Test
+    void testSolution1() {
+        assertEquals(17, Problem10.solution1(10));
+        assertEquals(142913828922L, Problem10.solution1(2000000));
+    }
+}

Original file line number	Diff line number	Diff line change
`@@ -16,7 +16,7 @@ public class Problem06 {`
`16`	`16`	`public static long solution1(int n) {`
`17`	`17`	`long sumOfSquares = 0;`
`18`	`18`	`for (int i = 1; i <= n; ++i) {`
`19`		`- sumOfSquares += Math.pow(i, 2);`
	`19`	`+ sumOfSquares = (long) (sumOfSquares + Math.pow(i, 2));`
`20`	`20`	`}`
`21`	`21`
`22`	`22`	`long squareOfSum = (long) Math.pow(SumToN.sum(n), 2);`