SHOW:
|
|
- or go back to the newest paste.
1 | import java.util.Scanner; | |
2 | ||
3 | public class PrimeTriangle { | |
4 | public static void main(String[] args) { | |
5 | Scanner scanner = new Scanner(System.in); | |
6 | int n = Integer.parseInt(scanner.nextLine()); | |
7 | StringBuilder stringBuilder = new StringBuilder(); | |
8 | ||
9 | for (int i = 1; i <= n; i++) { | |
10 | if (isPrime(i)) { | |
11 | stringBuilder.append("1"); | |
12 | System.out.println(stringBuilder); | |
13 | ||
14 | } else { | |
15 | stringBuilder.append("0"); | |
16 | } | |
17 | } | |
18 | } | |
19 | ||
20 | static boolean isPrime(int i) { | |
21 | int divider = 2; | |
22 | int maxDivider = (int) Math.sqrt(i); | |
23 | boolean prime = true; | |
24 | while (prime && (divider <= maxDivider)) { | |
25 | if (i % divider == 0) { | |
26 | prime = false; | |
27 | } | |
28 | divider++; | |
29 | } | |
30 | return prime; | |
31 | } | |
32 | } |