這道沒做出來，我是菜狗
鏈接：https://ac.nowcoder.com/acm/contest/42105/F
來源：牛客網

Cuber QQ is finding the minimal interesting number. An interesting number xx satisfies:

xx is a positive integer;
xx has at least eight factors;
The difference between any two different factors of xx is not less than nn.

Now, Cuber QQ will give you nn, and ask you to find the least interesting number.
輸入描述:
The first line contains an integer TT (1\le T\le 10001≤T≤1000), representing the number of test cases.

The following TT lines, each line contains an integer nn (1\le n\le 1000001≤n≤100000).
輸出描述:
For each test case, output an integer representing the answer.
示例1
輸入
復制
3
1
2
3
輸出
復制
24
105
935

#include<bits/stdc++.h>using namespace std; bool judge(long long a) {if(a == 1) return 1;if(a == 2 || a == 3) return 1;if(a%6 != 1 && a%6 != 5) return 0;int sqrtA = sqrt(a);for(int i = 5; i <= sqrtA; i += 6) {if(!(a%i)|| !(a%(i+2))) return 0;}return 1; } int main() {int t;cin >> t;while (t--) {long long i = 1, j = 0, ans = 1,n;cin >> n;if (n == 1) {cout << 24 << endl;continue;}while (j < 4) {if (judge(i)) {ans *= i;i += n;j++;}else {i++;}}cout << ans << endl;} }

總結

以上是生活随笔為你收集整理的F-Factor Difference的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。