The "C language" counts the element factor contained in an integer and outputs

#include <stdio.h>
#include <math.h>
int prime (int n) {
int i;
if (n<2) {
return 0;
}
for (I=2;I&LT;=SQRT (n); i++) {
if (n%i==0) {
return 0;
}
}
if (I&GT;=SQRT (n)) {
printf ("Prime:%d\n", N);
return 1;
}

}

void Main () {
int i,n,count=0;
while (1) {
printf ("Please enter an integer:");
scanf ("%d", &n);

for (i=0;i<=n;i++) {
Count+=prime (i);
}
printf ("Integer%d has%d prime factor \ n", N,count);
}
}

Remarks: for (I=2;I<=SQRT (n); i++) {
if (n%i==0) {
return 0;
}
}

In this code, the judge is not a prime number can not be used break, must use return 0, or the following count will be a very strange big numbers! Don't ask me how I know, the lesson of blood!

The "C language" counts the element factor contained in an integer and outputs