intprime(int p ){if(p <=1)return0;if(p ==2)return1;int i =2;for(i =2; i < p; i++){if(p % i ==0)return0;}return1;}intPrimeSum(int m,int n ){int sum =0, i =0;for(i = m; i <= n; i++){if(prime(i)==1) sum += i;}return sum;}
实验5-5 使用函数求素数和 (20分)代码:int prime( int p ){ if (p <= 1) return 0; if (p == 2) return 1; int i = 2; for (i = 2; i < p; i++) { if (p % i == 0) return 0; } return 1;}int PrimeSum( int m, int n ){ int sum = 0, i = 0; for (i = m; i <