C++ 解题：费马与定理 - 寻找阶乘加一的次小约数

"""\n#include "iostream"\n#include "vector"\nusing namespace std;\n\nvector<int> getDivisors(int n) {\n\tvector<int> divisors;\n\tfor (int i = 1; i * i <= n; i++) {\n\t if (n % i == 0) {\n\t divisors.push_back(i);\n\t if (i != n / i) {\n\t divisors.push_back(n / i);\n\t }\n\t }\n\t}\n\treturn divisors;\n}\n\nint main() {\n\tint T;\n\tcin >> T;\n\twhile (T--) {\n\t int d;\n\t cin >> d;\n\t vector<int> divisors = getDivisors(d - 1);\n\t int n = 0;\n\t for (int i = 0; i < divisors.size(); i++) {\n\t if (divisors[i] > d) {\n\t n = divisors[i] - 1;\n\t break;\n\t }\n\t }\n\t cout << n << endl;\n\t}\n\treturn 0;\n}\n"""\n