/*播布客教学视频_C学习笔记_7_100内最大的素数（97） 1.判断方法:一旦发现整除即不是素数判别到平方根其实就可以了每次判别时可以加2，跳过偶数2.break的使用方法（跳出最近的一层循环）3.条件编译方法“#if debug”"#endif""-D"*/#include<stdio.h>//#include<math.h>int main(void){int i = 0;int num = 100;int max;printf("max prime from 1 to 100n");//scanf("%d",&num);for(num = 1;num <= 100;num += 2){int tmp = num -1;//求平方根函数//int tmp = sqrt(num);for(i = 2;i <= tmp;i++){if(num % i == 0)//整除了，即约数{//#if debug//printf("i = %dn",i);printf("num %d is not a primen",num);//#endifbreak;//一旦发现一个约数就说明不是素数，跳出for循环}}//printf("i = %dn",i);if(i == num){max = num;printf("num %d is a primen",num);}}printf("The max prime is %dn",max);return 0;}