We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Leonardo's Prime Factors
Leonardo's Prime Factors
Sort by
recency
|
339 Discussions
|
Please Login in order to post a comment
The most beautiful implementation
if(n<2){ return 0; } else if(n<6){ return 1; } else if(n<30){ return 2; } else if(n<210){ return 3; } else if(n<2310){ return 4; } else if(n<30030){ return 5; } else if(n<510510){ return 6; } else if(n<9699690){ return 7; } else if(n<223092870){ return 8; } else if(n<6469693230){ return 9; } else if(n<200560490130){ return 10; } else if(n<7420738134810){ return 11; } else if(n<304250263527210){ return 12; } else if(n<13082761331670030){ return 13; } else if(n<614889782588491410){ return 14; } return 15;
I am trying to use sympy.primerange to get alist of prime numbers, but the output fails with message "no module sympy found"
How can we solve this issue. to access sympy I used
import sympy
this is my code
define ll unsigned long long int
include
using namespace std; ll solve (ll n){ ll cnt=0,s=1; vector check {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293}; for(ll i=0;i
} int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); ll q; cin>>q; for(ll j=0;j>n; cout<
}
}
Here my code
I don't understand the problem or the way it's supposed to be answered. Why does it say the numbers 100, 30, and 42, have 3 distinct prime values? Which numbers are these supposed to be?