本程式利用C語言驗證哥德巴赫猜想
代碼如下
#include<stdio.h>
#include<math.h>
void spilt_eve(unsigned int array[3]);
void spilt_odd(unsigned int array[4]);
int isprime(int x);
void error_1(int a);
void main()
{
unsigned int a = 1, c = 1;
unsigned int eve[3] = { 0 };
unsigned int odd[4] = { 0 };
//輸入數字
for (; a != 0;)
{
printf("Please input a number.\n(from 0 to 65535)\n");//最好不要輸入超過65535的數字，否則會讓本程式運行時間過長
scanf_s("%d", &a);
if ((a % 2 == 0) && (a < 6))
{
printf("Error Begin.\nif the number is even number, please make sure that it is beyond 6.\n");
error_1(1);
continue;
}
else if ((a % 2 != 0) && (a < 9))
{
printf("Error Begin.\nif the number is odd number, please make sure that it's beyond 9.\n");
error_1(1);
continue;
}
//將數字進行分類，分出奇數和偶數
if (a % 2 == 0)
{
eve[0] = a;
spilt_eve(eve);
}
else
{
odd[0] = a;
spilt_odd(odd);
}
}
}
//確保輸出的數字不是前一個數字
int isprime(int x)
{
int i, j = 1;
for (i = 2; i <= (int)sqrt(x); i++)
{
if (x % i == 0)
{
j = 0;
break;
}
}
return(j);
}
void error_1(int a)
{
printf("請選擇一個合適的數字");
}
//偶數
void spilt_eve(unsigned int eve[3])
{
int i, j;
i = eve[0];
for (j = 3; j <= i / 2; j++)
{
if (isprime(j) == 1)
{
if ((isprime(i - j == 1)))
{
eve[1] = j;
eve[2] = i - j;
printf("%d=%d+%d\n", eve[0], eve[1], eve[2]);
}
}
}
}
//奇數
void spilt_odd(unsigned int odd[4])
{
unsigned int eve[3];
int i, j, k;
i = odd[0];
for (k = 3; k <= i / 3; k++)
{
if (isprime(k) == 1)
{
for (j = k; j <= i / 2; j++)
{
if (isprime(j) == 1)
{
if (isprime(i - k - j) == 1 && ((i - k - j) >= j))
{
odd[1] = k;
odd[2] = j;
odd[3] = i - k - j;
printf("%d=%d+%d+%d\n", odd[0], odd[1], odd[2], odd[3]);
}
}
}
}
}
}
warning:::如果你們不怕電腦CPU燒掉，輸入100億以內的數字還是可以的
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/240138.html
標籤：其他
上一篇：同步方法以及同步塊