forked from nayuki/Project-Euler-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathp001.java
More file actions
30 lines (24 loc) · 711 Bytes
/
p001.java
File metadata and controls
30 lines (24 loc) · 711 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
/*
* Solution to Project Euler problem 1
* Copyright (c) Project Nayuki. All rights reserved.
*
* https://www.nayuki.io/page/project-euler-solutions
* https://github.com/nayuki/Project-Euler-solutions
*/
public final class p001 implements EulerSolution {
public static void main(String[] args) {
System.out.println(new p001().run());
}
/*
* Computers are fast, so we can implement this solution directly without any clever math.
* A conservative upper bound for the sum is 1000 * 1000, which fits in a Java int type.
*/
public String run() {
int sum = 0;
for (int i = 0; i < 1000; i++) {
if (i % 3 == 0 || i % 5 == 0)
sum += i;
}
return Integer.toString(sum);
}
}