优化这个最大素因子程序的最佳方法

Question

I need some help optimizing this program. I am trying to figure out the largest prime factor for input. However, it occasionally has timeout issues, so I am interested in figuring out how to optimize it.

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class PFactor() {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        
        for(int a0 = 0; a0 < t; a0++){
            long n = in.nextLong();
            System.out.println(pMod(n));
        }
    }

    public static int pMod(long d) {
        long maxVal = 0;
        
        for (long i = 2; i <= d; i++) {
            if (d % i == 0) {
                boolean prime = pCount(i);
                if (prime == true) {
                    max = i;
                }
            } else {                
                max = max;
            }
        }
        return (int)max;
    }
    
    public static boolean pCount(long inLong) {
        int count = 0;
        for (long s = 1; s <= inLong; s++) {
            if (inLong % s == 0) {
                count++;
            } 
        }
        
        if (count == 2) {
            return true;
        } else {
            return false;
        }
    }
}

Do you know how to optimize this code so that it does not have as many timeouts? I need this ready soon for something at work, so I decided to reach out to see if I could get some help, as I can't seem to figure it out myself where it needs further optimization.

Answer 1

I actuallly found a solution guys after a bit of tinkering with it! you were all very helpful though! Thanks for helping!