#include<stdio.h>
int main()
{
	int m, n;
	printf("您想求哪兩個(gè)數(shù)之間的素?cái)?shù)之和，請(qǐng)依次輸入它們：");
	scanf_s("%d %d", &m, &n);
	int i;
	int cnt = 0;
	int sum = 0;

	if (m==1)
	{
		m = 2;
	}
	for ( i = m; i <= n; i++)
	{
		int isPrime = 1;
		int k;
		for ( k = 2; k <=i-1; k++)
		{
			if (i%k==0)
			{
				isPrime = 0;
				break;
			}
		}
		if (isPrime)
		{
			cnt++;
			sum += i;
		}
	}
	printf("%d %d\n", cnt, sum);
	return 0;
}

#include <stdio.h>
#include <math.h>
int main()
{
	int i,j,count=0;//count 統(tǒng)計(jì)個(gè)數(shù)
	i = 2;//i是2到100
	while(i<=100)
	{
		j = 2;
		while(j<=sqrt(i))//取余
		{
			if(i%j==0)
			{
				break;
			}
			j++;
		}

		if(j>sqrt(i))
		{
			printf("%4d Is Prime!\n",i);
			count += 1;
		}
		i++;
	}
	return 0;
}