素数和

#include<stdio.h>

int main(void)
{
    int n, m;
    int i;
    int isPrime;
    int sum;
    int count;

    i = 2;                        //第一个素数
    sum = 0;
    count = 0;                    //符合条件的素数个数
    scanf_s("%d %d", &n, &m);

    do
    {
        isPrime = 1;

        for (int j = 2; j < i; j++)
        {
            if (i % j == 0)
            {
                isPrime = 0;
                break;
            }
        }

        if (isPrime)
        {
            count++;

            if (count >= n)
            {
                sum = sum + i;
            }
        }    

        i++;
    } while (count < m);

    printf("%d
", sum);

    return 0;
}