C++ 优化程序：解决n=10^5导致的栈溢出问题

#include\n#include\nusing namespace std;\n\nbool isPrime(int num) {\n if (num < 2) return false;\n if (num == 2) return true;\n if (num % 2 == 0) return false;\n for (int i = 3; i * i <= num; i += 2) {\n if (num % i == 0) return false;\n }\n return true;\n}\n\nint main() {\n int n;\n cin >> n;\n vector isComposite(100001, false);\n for (int i = 0; i < n; i++) {\n int sb, bs;\n cin >> sb >> bs;\n if (sb <= 2) sb = 3;\n int count = 0;\n for (int j = sb; j <= bs; j++) {\n if (isComposite[j]) {\n count++;\n } else if (!isPrime(j)) {\n isComposite[j] = true;\n count++;\n }\n }\n cout << count << endl;\n }\n return 0;\n}