Jump to content

Powerful numbers: Difference between revisions

Powerful numbers (view source)

Revision as of 11:26, 27 December 2023

101 bytes removed ,  5 months ago
m
C++ - removed unnecessary hack
(Added 11l)
m (C++ - removed unnecessary hack)
Line 160:
 
bool is_square_free(uint64_t n) {
if (n % p24 == 0)▼
static constexpr uint64_t primes[] {
return false;▼
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
for (uint64_t p = 43,3; 47,p 53,* 59,p 61,<= 67,n; 71,p 73,+= 79,2) 83, 89, 97{
}; // seems to beuint64_t enoughcount = 0;
for (auto; n % p :== primes0; n /= p) {
auto p2 = p *if p;(++count > 1)
if (p2 > n) return false;
break;}
▲ if (n % p2 == 0)
▲ return false;
}
return true;
Simonjsaunders
1,777

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/354072"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information