摘要： 1 #include <stdio.h> 2 #include <math.h> 3 //递归算法 4 int recursion(int a,int b) 5 { 6 int tem = 1; 7 if(b==0)return 1; 8 else if(b==1)return a; 9 tem = recursion(a,b>>1);10 tem = tem*tem;11 if(b&1) tem = tem * a;12 return tem;13 }14 //循环算法15 int loop(int a,int b)16 {17 ... 阅读全文

摘要： 1 #include <stdio.h> 2 3 bool If_prime(int a,int b) 4 { 5 int c; 6 while(b>0) 7 { 8 c = a%b; 9 a = b;10 b = c;11 }12 if(a==1)return true;13 else return false;14 }15 int main()16 {17 int num,i;18 while(true)19 {20 printf("input the... 阅读全文