Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int isPrime(long N);
- int getFactor(long n){
- int i = 2,mprimo;
- while(i <= n){
- if(n % i == 0){
- if(isPrime(i)){
- mprimo = i;
- n=n/i;
- }
- }else i++;
- }
- return mprimo;
- }
- int isPrime(long N){
- for(int i = 2; i < N; i++){
- if ((N%i) == 0) return 0;
- }
- return 1;
- }
- int main(){
- printf("%d\n",getFactor(600851475143));
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement