实验6-6 使用函数验证哥德巴赫猜想 (20分)

http://pta.patest.cn/pta/test/13/exam/3/question/478

#include <stdio.h>
#include <math.h>
int prime( int p );
void Goldbach( int n );
int main() {
int m, n, i, cnt;
scanf("%d %d", &m, &n);
if ( prime(m) != 0 ) printf("%d is a prime number\n", m);
if ( m < 6 ) m = 6;
if ( m%2 ) m++;
cnt = 0;
for( i=m; i<=n; i+=2 ) {
Goldbach(i);
cnt++;