Advertisement
Guest User

Untitled

a guest
Sep 23rd, 2019
129
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.26 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. typedef long long ll;
  6.  
  7. bool first_last(int n) {
  8. int last = n % 10;
  9. int first = n;
  10. while (first > 9) {
  11. first /= 10;
  12. }
  13. return first == last;
  14. }
  15.  
  16. int main() {
  17. int n, k;
  18. cin >> k >> n;
  19. vector<bool> nums(n + 1, true);
  20. for (ll i = 2; i < n + 1; ++i) {
  21. if (nums[i]) {
  22. for (ll j = i * i; j < n + 1; j += i)
  23. nums[j]= false;
  24. }
  25. }
  26. bool flag = true;
  27. for (int i = k; i <= n; ++i) {
  28. if (nums[i] && first_last(i)) {
  29. cout << i << " ";
  30. flag = false;
  31. }
  32. }
  33. if (flag) cout << 0;
  34. // return 0;
  35. }
  36. // ----------------------------------------------------------
  37.  
  38. #include<bits/stdc++.h>
  39.  
  40. using namespace std;
  41.  
  42. typedef long long ll;
  43.  
  44. bool odd_sum(int n) {
  45. int sum = 0;
  46. while (n > 9) {
  47. sum += n % 10;
  48. n /= 10;
  49. }
  50. return (sum + n) % 2 == 0;
  51. }
  52.  
  53. int main() {
  54. int n, k;
  55. cin >> k >> n;
  56. vector<bool> nums(n + 1, true);
  57. for (ll i = 2; i < n + 1; ++i) {
  58. if (nums[i]) {
  59. for (ll j = i * i; j < n + 1; j += i)
  60. nums[j]= false;
  61. }
  62. }
  63. bool flag = true;
  64. for (int i = k; i <= n; ++i) {
  65. if (nums[i] && odd_sum(i)) {
  66. cout << i << " ";
  67. flag = false;
  68. }
  69. }
  70. if (flag) cout << 0;
  71. // return 0;
  72. }
  73. // --------------------------------------------------------------
  74. #include<bits/stdc++.h>
  75.  
  76. using namespace std;
  77.  
  78. typedef long long ll;
  79.  
  80. bool odd_sum(int n) {
  81. int prev = n % 10;
  82. int cur;
  83. while (n > 9) {
  84. n /= 10;
  85. cur = n % 10;
  86. if (cur <= prev) {
  87. return false;
  88. }
  89. prev = cur;
  90. }
  91. return true;
  92. }
  93.  
  94. int main() {
  95. int n, k;
  96. cin >> k >> n;
  97. vector<bool> nums(n + 1, true);
  98. for (ll i = 2; i < n + 1; ++i) {
  99. if (nums[i]) {
  100. for (ll j = i * i; j < n + 1; j += i)
  101. nums[j]= false;
  102. }
  103. }
  104. bool flag = true;
  105. for (int i = k; i <= n; ++i) {
  106. if (nums[i] && odd_sum(i)) {
  107. cout << i << " ";
  108. flag = false;
  109. }
  110. }
  111. if (flag) cout << 0;
  112. // return 0;
  113. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement