Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public class Naloga1 {
- public static void main(String args[]) {
- int max = 100;
- int[] tab = new int[max];
- for (int i = 1; i < max + 1; i++) {
- tab[i - 1] = i;
- }
- for (int i = 1; i < tab.length; i++) {
- if (tab[i] != 0) {
- for (int n = i + tab[i]; n < tab.length; n += tab[i]) {
- tab[n] = 0;
- }
- }
- }
- for (int i : tab)
- if (i != 0)
- System.out.println(i);
- }
- }
Add Comment
Please, Sign In to add comment