用编程方法验证哥德巴赫猜想

1、#define _CRT_SECURE_NO_WARNINGS//先关闭安全检查

2、#include<stdio.h>#include<stdlib.h>//输入头文件

3、int isit(int num)//1代表质数，0代表偶数{   //质数只能是被1和自身整除     if (num <= 1)     {          printf("不是质数");          return 0;      }      else if(num == 2 || num == 3)      {            return 1;//是质数       }     else       {          int flag = 1;//假定是质数          for (int i = 2; i < num; i++)              {                   if (num%i == 0)//num可以整除i                    {                          flag = 0;//不是质数                          break;                      }                }             return flag;        }

}

void text()//测试函数，测试单个模块的可靠性{     int data;     scanf("%d", &data);     if (isit(data) == 1)     {        printf("是质数");     }     else     {        printf("非质数");     }

       system("pause");

}

int isou(int num)//偶数返回1，质数返回0 {       if (num % 2 == 0)     {        return 1;     }     else     {         return 0;      }}

void main(){     int data;     scanf("%d", &data);     if (isou(data) == 0)     {        printf("错误不是偶数");        system("pause");      }     else     {        if (data == 2)             {                 printf("输入偶数太小");              }         else             {                  for (int i = 2; i < data; i++)//实现循环                   {                    if (isit(i) == 1 && isit(data - i) == 1)//判定下两个数是否为质数                         {                              printf("%d=%d+%d", data, i, data - i);//拆解                              break;                         }                     }                }           }

 system("pause");

}