Advertisement
Guest User

java help

a guest
Jan 18th, 2018
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.93 KB | None | 0 0
  1. void print_money(int n) {
  2. if(n <= 99999) {
  3. printf("$%d.%d\n", n/100, n%100);
  4. } else if (n <= 99999999) {
  5. printf("$%d,%d.%d\n", n/100000, (n/100)%1000, n%100);
  6. } else {
  7. printf("$%d,%d,%d.%d\n", n/100000000, (n/100000)%1000, (n/100)%1000, n%100);
  8. }
  9. }
  10.  
  11. bool is_prime_core(int k, int n) {
  12. if(k == 1) {
  13. return true;
  14. } else if(0 == (n % k)) {
  15. return false;
  16. } else {
  17. return is_prime_core(k-1, n);
  18. }
  19. }
  20.  
  21. bool is_prime(int n) {
  22. return is_prime_core(n - 1, n);
  23. }
  24.  
  25. void help_print_primes(k, n) {
  26. if(k == n) {
  27. if(is_prime(n)) {
  28. printf(" %d.\n", n);
  29. } else {
  30. printf(".\n");
  31. }
  32. } else if (k == 2) {
  33. printf("%d", 2);
  34. help_print_primes(k+1, n);
  35. } else {
  36. if(is_prime(k)) {
  37. printf(" %d", k);
  38. help_print_primes(k+1, n);
  39. } else {
  40. help_print_primes(k+1, n);
  41. }
  42. }
  43. }
  44.  
  45. void print_primes(int n) {
  46. help_print_primes(2, n);
  47. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement