Guest User

Untitled

a guest
Jul 22nd, 2018
76
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.85 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<math.h>
  3. #define ERROR 0.00000001
  4.  
  5. int prime[1000005] = { 1, 1, 0 };
  6. int main()
  7. {
  8. long long i, j;
  9. for( i = 2 ; i <= 1000000 ; i++ )
  10. if( !prime[i] )
  11. for( j = i+i ; j <= 1000000 ; j+=i )
  12. prime[j] = 1;
  13.  
  14. long long value;
  15. while( scanf( "%lld", &value ) != EOF && value >= 0 )
  16. {
  17. long long value_temp = (long long)(sqrt( (double)value ) + ERROR);
  18. if( value_temp > 1000000 )
  19. value_temp = 1000000;
  20. for( i = 2 ; i <= value_temp ; i++ )
  21. {
  22. if( !prime[i] )
  23. while( !(value % i) )
  24. {
  25. value /= i;
  26. printf( " %lld\n", i );
  27. }
  28. }
  29. if( value > 1 )
  30. printf( " %lld\n", value );
  31. printf( "\n" );
  32. }
  33.  
  34. return 0;
  35. }
Add Comment
Please, Sign In to add comment