简易算法收集。原创哦。。

Elyric

求素数

int prime(int n){int i;for(i=2;i<=n;i++){if(n%i==0){return 0;}}return n;}

高效取幂运算
//判断奇偶方法int IsEven(unsigned int n){if(n%2==0){return 1;}else{return 0;}}long int Pow(long int x,unsigned int n){if(n==0){return 1;}if(n==1){return x;}if(IsEven(n)){return Pow(x*x,n/2);}else{return Pow(x*x,n/2)*x;}}