全ACGO最短题解
2024-07-11 11:16:10
发布于:江苏
52阅读
0回复
0点赞
#include<iostream>
using namespace std;bool is_prime(int n) {if (n <= 1) return false;if (n == 2 || n == 3) return true;if (n % 2 == 0 || n % 3 == 0) return false;for (int i = 5; i * i <= n; i += 6) {if (n % i == 0 || n % (i + 2) == 0) return false;}return true;}int main() {int n;cin >> n;if (is_prime(n)) cout << "Yes" << endl;else cout << "No" << endl;return 0;}
全部评论 4
顶
2024-07-11 来自 江苏
1#include<iostream> using namespace std;int main(){int n;cin>>n;if(n==1){cout <<"No";return 0;}cout<<([](int n){int i=3;for(;i*i<=n;i+=2)if(n<2||n%2==0||n%i==0)return"No";return"Yes";})(n);}
究极压缩(极限了)
2025-01-21 来自 浙江
0#include<iostream> using namespace std;int main(){int n;cin>>n;cout<<([](int n){if(n<=1)return"No";if(n%2==0||n==2)return n==2?"Yes":"No";for(int i=3;i*i<=n;i+=2)if(n%i==0)return"No";return"Yes";})(n);}
三次压缩
2025-01-21 来自 浙江
0#include<iostream> using namespace std;string is_prime(int n) {if (n <= 1) return "No";if (n == 2 || n == 3) return "Yes";if (n % 2 == 0 || n % 3 == 0) return "No";for (int i = 5; i * i <= n; i += 6) {if (n % i == 0 || n % (i + 2) == 0) return "No";}return "Yes";}int main() {int n;cin >> n;cout << is_prime(n);}
更短(二次压缩)
2025-01-21 来自 浙江
0
有帮助,赞一个