Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- import java.util.*;
- public class Lukujono {
- PriorityQueue<Integer> lukulista;
- public Lukujono() {
- lukulista = new PriorityQueue<>();
- }
- public long laske(int n) {
- int[] listaindeksit = new int[100000];
- int kakkoset = 0;
- int kolmoset = 0;
- int viitoset = 0;
- int lisataan = 1;
- listaindeksit[0] = 1;
- while (true) {
- int a = 2 * listaindeksit[kakkoset];
- int b = 3 * listaindeksit[kolmoset];
- int c = 5 * listaindeksit[viitoset];
- int pienin = Math.min(a, Math.min(b, c));
- if (pienin == a) {
- lukulista.add(a);
- listaindeksit[lisataan] = a;
- lisataan++;
- kakkoset++;
- } else if (pienin == b) {
- lukulista.add(b);
- listaindeksit[lisataan] = b;
- lisataan++;
- kolmoset++;
- } else if (pienin == c) {
- lukulista.add(c);
- listaindeksit[lisataan] = c;
- lisataan++;
- viitoset++;
- }
- if (listaindeksit[99] > 100) {
- break;
- }
- }
- return listaindeksit[n];
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement