// fipf(FactorizationInPrimeFactors)
public ArrayList<Integer> fipf(int n) {
ArrayList<Integer> primes = new ArrayList<Integer>();
while(!(n == 1)) {
for(int prime = 2; prime <= n; prime++) {
// 나머지가 0이면 소수.
if (n % prime == 0) {
n /= prime;
primes.add(prime);
break;
}
}
}
return primes;
}
Created
June 20, 2018 05:57
-
-
Save audrl1010/1ad2e7cc836081c397a3b6507ebaeb7c to your computer and use it in GitHub Desktop.
소인수분해
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment