题解 | #牛牛的素数和#
牛牛的素数和
https://www.nowcoder.com/practice/d748d79f68ab443482c5547d93824f50
#include <stdio.h> int primrNumber(int a, int b) { int count = 0; int sum = 0; if (a == 1) { sum = 1; a++; } else if (a != 1) { for (int i = a; i <= b; i++) { int flag = 1; for (int j = 2; j <= b; j++) { if (i % j == 0 && i!=j) { flag = 0; break; } } if (flag) sum += i; } } return sum; } int main() { int a, b; scanf("%d %d", &a, &b); primrNumber(a, b); printf("%d", primrNumber(a, b)); return 0; }