HDU5391-Zball in Tina Town
来源:互联网 发布:博客助赢软件cpzyrj 编辑:程序博客网 时间:2024/04/29 21:41
在初等数论中,威尔逊定理给出了判定一个自然数是否为素数的充分必要条件。即:当且仅当p为素数时:( p -1 )! ≡ -1 ( mod p ),但是由于阶乘是呈爆炸增长的,其结论对于实际操作意义不大。
4的时候特判,在快速判断是否是素数。
#include<iostream>#include<cstring>#include<cstdio>#include<math.h>#include<algorithm>using namespace std;bool isPrimeNum(int num){ if (num <= 2) { return num == 2; } if (num % 2 == 0) { return false; } int iSqrt = sqrt(num); for (int i = 3; i <= iSqrt; i+=2) { if (num % i == 0) { return false; } } return true;}int main(){ int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); if(n==4) printf("2\n"); else if(isPrimeNum(n)) printf("%d\n",n-1); else printf("0\n"); } return 0;}
0 0
- HDU5391-Zball in Tina Town
- hdu5391 Zball in Tina Town
- HDU5391 Zball in Tina Town 威尔逊定理
- hdu5391 Zball in Tina Town(素数筛法)
- hdu5391 Zball in Tina Town(打表找规律)
- HDU5391 Zball in Tina Town(埃拉托斯尼斯判断素数)
- Zball in Tina Town
- Zball in Tina Town
- Zball in Tina Town HDU
- hdu 5391 Zball in Tina Town
- hdu 5391 Zball in Tina Town (数学)
- hdu 5391 Zball in Tina Town
- hdu 5391 Zball in Tina Town
- HDU-5391 Zball in Tina Town
- HDU 5391-Zball in Tina Town(数论)
- HDU 5391 Zball in Tina Town
- HDU-5391-Zball in Tina Town
- HDOJ 5391 Zball in Tina Town
- hdu 1130 How Many Trees?(卡特兰数,大数的乘法与除法)
- Cocos2dx——瓦片地图(Tiled Map)
- 黑马程序员——Java基础03
- HDU 1501 Zipper
- hdu 2814
- HDU5391-Zball in Tina Town
- HDU 4450 Draw Something
- JAVA基础(二)
- 去哪网实习总结:java读写excel表格(JavaWeb)
- Javascript将数字转为中文大写金额形式
- Django之第一个app<1>
- 【React】热热身:Hello World
- 2.5 寻找最大的k个数
- LeetCode(59)Length of Last Word