\n \uc548\ub155\ud558\uc138\uc694, \uc5ec\ub7ec\ubd84. \uc774 \uac15\uc88c\uc5d0\uc11c\ub294 C++\uc744 \uc774\uc6a9\ud55c \ucf54\ub529 \ud14c\uc2a4\ud2b8 \ubb38\uc81c\ub97c \ud480\uc5b4\ubcf4\ub3c4\ub85d \ud558\uaca0\uc2b5\ub2c8\ub2e4. \n \uc8fc\uc5b4\uc9c4 \ubc94\uc704 [L, R] \ub0b4\uc758 \ubaa8\ub4e0 \uc18c\uc218\ub97c \ucc3e\ub294 \ubb38\uc81c\uc785\ub2c8\ub2e4. \n \uacfc\uc81c\ub97c \uc704\ud574 \ucf54\ub4dc\uc758 \uc2dc\uac04 \ubcf5\uc7a1\ub3c4\ub97c \uace0\ub824\ud558\uba74\uc11c \ud6a8\uc728\uc801\uc73c\ub85c \uc18c\uc218\ub97c \ucc3e\uc544\ubcf4\uaca0\uc2b5\ub2c8\ub2e4.\n <\/p>\n \n \ub450 \uc815\uc218 L, R (1 \u2264 L \u2264 R \u2264 1000000) \uc8fc\uc5b4\uc9d1\ub2c8\ub2e4.\n <\/p>\n \n L\uacfc R \uc0ac\uc774\uc758 \ubaa8\ub4e0 \uc18c\uc218\ub97c \ucd9c\ub825\ud569\ub2c8\ub2e4. \n \uc18c\uc218\ub97c \ucc3e\uae30 \uc704\ud574 Sieve of Eratosthenes \uc54c\uace0\ub9ac\uc998\uc744 \uc0ac\uc6a9\ud560 \uac83\uc785\ub2c8\ub2e4. \n \uc704\uc758 \ucf54\ub4dc\ub294 \ub450 \uac1c\uc758 \uc8fc\uc694 \ud568\uc218\ub97c \ud3ec\ud568\ud558\uace0 \uc788\uc2b5\ub2c8\ub2e4:\n <\/p>\n \n \uc774\ubc88 \uac15\uc88c\uc5d0\uc11c\ub294 \uac04\ub2e8\ud55c \uc18c\uc218 \ucc3e\uae30 \ubb38\uc81c\ub97c \ud1b5\ud574 C++ \uc5b8\uc5b4\uc640 \uc790\ub8cc\uad6c\uc870\uc5d0 \ub300\ud55c \uac10\uac01\uc744 \ud0a4\uc6b8 \uc218 \uc788\uc5c8\uc2b5\ub2c8\ub2e4. \n \ub0b4\uc6a9\uc774 \uc720\uc775\ud558\uc168\ub2e4\uba74 \ub313\uae00\ub85c \uc758\uacac \ub0a8\uaca8\uc8fc\uc138\uc694. \uc9c8\ubb38 \uc5ec\ubd80\ub3c4 \ud658\uc601\ud569\ub2c8\ub2e4!\n <\/p>\n <\/body><\/p>\n","protected":false},"excerpt":{"rendered":"
\n \uc8fc\uc81c\ub294 \ubc14\ub85c “\uc2e0\uae30\ud55c \uc18c\uc218 \ucc3e\uae30<\/strong>“\ub85c, \uc18c\uc218\uc5d0 \ub300\ud55c \uae4a\uc774 \uc788\ub294 \uc774\ud574\uc640 \ub354\ubd88\uc5b4
\n \uc54c\uace0\ub9ac\uc998 \uc124\uacc4 \ubc0f \ucd5c\uc801\ud654\uae4c\uc9c0 \ub2e4\ub8e8\uc5b4 \ubcf4\uaca0\uc2b5\ub2c8\ub2e4.\n <\/p>\n\ubb38\uc81c \uc124\uba85<\/h2>\n
\n \uc18c\uc218\ub294 1\ubcf4\ub2e4 \ud070 \uc790\uc5f0\uc218 \uc911\uc5d0\uc11c 1\uacfc \uc790\uae30 \uc790\uc2e0\ub9cc\uc744 \uc57d\uc218\ub85c \uac00\uc9c0\ub294 \uc218\ub97c \uc758\ubbf8\ud569\ub2c8\ub2e4.
\n \uc774\ubc88 \ubb38\uc81c\uc5d0\uc11c\ub294 \uc18c\uc218\ub97c \ucc3e\ub294 \uacfc\uc815\uc5d0\uc11c \ub2e4\uc74c \ub450 \uac00\uc9c0 \uc870\uac74\uc744 \ucda9\uc871\ud574\uc57c \ud569\ub2c8\ub2e4:\n <\/p>\n\n
\uc785\ub825<\/h2>\n
\ucd9c\ub825<\/h2>\n
\n \ud2b9\ud788, 2 \uc774\uc0c1\uc758 \uc18c\uc218 \uc911\uc5d0\uc11c \uadf8 \uc18c\uc218\uc758 \ubaa8\ub4e0 \uc790\ub9ac\uac00 1, 2, 3, 5, 7\uc758 \uc870\ud569\uc73c\ub85c \uc774\ub8e8\uc5b4\uc9c4 \uacbd\uc6b0 “\uc2e0\uae30\ud55c”\uc744 \ucd9c\ub825\ud569\ub2c8\ub2e4.\n <\/p>\n\uc608\uc81c<\/h2>\n
\n \uc785\ub825:\n 10 30\n\n \ucd9c\ub825:\n 11 \uc2e0\uae30\ud55c\n 13 \uc2e0\uae30\ud55c\n 17 \uc2e0\uae30\ud55c\n 19 \uc2e0\uae30\ud55c\n 23 \uc2e0\uae30\ud55c\n 29 \uc2e0\uae30\ud55c\n <\/pre>\n
\ubb38\uc81c \ud480\uc774 \uacc4\ud68d<\/h2>\n
\n
\uc54c\uace0\ub9ac\uc998 \uc124\uba85<\/h2>\n
\n \uc774 \ubc29\ubc95\uc740 \uc8fc\uc5b4\uc9c4 \ubc94\uc704 \ub0b4\uc5d0\uc11c \uc18c\uc218\ub97c \ud6a8\uc728\uc801\uc73c\ub85c \ucc3e\ub294 \ub370 \ub9e4\uc6b0 \uc720\uc6a9\ud569\ub2c8\ub2e4.
\n \uc54c\uace0\ub9ac\uc998\uc758 \uae30\ubcf8 \uc6d0\ub9ac\ub294 \ub2e4\uc74c\uacfc \uac19\uc2b5\ub2c8\ub2e4:\n <\/p>\n\n
C++ \ucf54\ub4dc \uad6c\ud604<\/h2>\n
\n#include <iostream>\n#include <vector>\n#include <string>\n\nusing namespace std;\n\n\/\/ \uc8fc\uc5b4\uc9c4 \uc22b\uc790\uac00 \uc2e0\uae30\ud55c \uc18c\uc218\uc778\uc9c0 \uccb4\ud06c\ud558\ub294 \ud568\uc218\nbool isMagicalPrime(int num) {\n string s = to_string(num);\n for(char c : s) {\n if(c != '1' && c != '2' && c != '3' && c != '5' && c != '7') {\n return false;\n }\n }\n return true;\n}\n\n\/\/ \uc18c\uc218\ub97c \ucc3e\ub294 Sieve of Eratosthenes \uc54c\uace0\ub9ac\uc998\nvector<bool> sieve(int maxNum) {\n vector<bool> isPrime(maxNum + 1, true);\n isPrime[0] = isPrime[1] = false; \/\/ 0\uacfc 1\uc740 \uc18c\uc218\uac00 \uc544\ub2d8\n for(int i = 2; i * i <= maxNum; i++) {\n if(isPrime[i]) {\n for(int j = i * i; j <= maxNum; j += i) {\n isPrime[j] = false;\n }\n }\n }\n return isPrime;\n}\n\nint main() {\n int L, R;\n cin >> L >> R;\n\n vector<bool> prime = sieve(R);\n \n for(int i = L; i <= R; i++) {\n if(prime[i]) {\n cout << i;\n if(isMagicalPrime(i)) {\n cout << \" \uc2e0\uae30\ud55c\";\n }\n cout << endl;\n }\n }\n return 0;\n}\n <\/code><\/pre>\n\ucf54\ub4dc \uc124\uba85<\/h2>\n
\n
\n \uc8fc\uc5b4\uc9c4 \uc22b\uc790\ub97c \ubb38\uc790\uc5f4\ub85c \ubcc0\ud658\ud558\uc5ec \uac01 \uc790\ub9ac\uc218\ub97c \ubd84\uc11d\ud569\ub2c8\ub2e4.
\n \uc790\ub9ac\uc218\uac00 ‘1, 2, 3, 5, 7’ \uc911 \ud558\ub098\uc778 \uacbd\uc6b0\uc5d0\ub9cc true\ub97c \ubc18\ud658\ud569\ub2c8\ub2e4.<\/li>\n
\n \uc8fc\uc5b4\uc9c4 \ucd5c\ub300 \uc22b\uc790\uae4c\uc9c0 \uc18c\uc218\ub97c \uacc4\uc0b0\ud558\uc5ec bool \ubca1\ud130\ub97c \ubc18\ud658\ud569\ub2c8\ub2e4.<\/li>\n<\/ul>\n\uacb0\ub860<\/h2>\n
\n \ub610\ud55c Sieve of Eratosthenes \uc54c\uace0\ub9ac\uc998\uc744 \uc2e4\uc81c\ub85c \uc0ac\uc6a9\ud558\uc5ec \ud6a8\uc728\uc801\uc778 \uc18c\uc218 \uac80\uc0c9 \ubc29\ubc95\uc744 \uccb4\ud5d8\ud574 \ubcfc \uc218 \uc788\uc5c8\uc2b5\ub2c8\ub2e4.
\n \ub2e4\uc74c \uc2dc\uac04\uc5d0\ub294 \uc880 \ub354 \ubcf5\uc7a1\ud55c \ubb38\uc81c\ub97c \ub2e4\ub8e8\uc5b4 \ubcf4\ub3c4\ub85d \ud558\uaca0\uc2b5\ub2c8\ub2e4.\n <\/p>\n