04-3. Count the prime number and sum (20)

Calculate the number of prime numbers in the given integer m and n and sum them.

Input Format:

Input two positive integers m and n (1 <= m <= n <= 500) in a row ).

Output Format:

In a row, the number of prime numbers in the M and N intervals and their sum are output sequentially. Numbers are separated by spaces.

Input example:

10 31

Output example:

7 143

Note: Calculate the prime number first. Every time one is counted, add 1 to the counter and perform the sum operation.

#include "stdio.h"int main(){    int M,N;    scanf("%d %d",&M,&N);    int i=2,j=0;    int count=0,reg=0;    while(M<=N)    {        while(i<=M)        {            while(M%i==0)            {                j++;                i++;            }            i++;        }        i=2;        if(j==1)        {            reg+=M;            count++;        }        j=0;        M++;    }    printf("%d %d",count,reg);    return 0;}

04-3. Count the prime number and sum (20)