#include <stdio.h>
//関数のプロトタイプ宣言
void goldbach(int n);
void print(int a, int b);
int prime(int n);
//main関数
int main(void){
int a;
goldbach(a);
return 0;
}
// ゴールドバッハ予想
void goldbach(int n){
int i;
for(i = 2; i <= n/2; i++){
if(prime(i) && prime(n - i)){
print(i, n - i);
}
}
}
//結果表示
void print(int a, int b){
static int count = 0;
count++;
printf("%2d: %d = %d + %d\n", count
, a
+b
, a
, b
); }
//素数判定
int prime(int n){
int i;
int sosuu = 1;
for(i=2; i<n; i++){
if(n%i==0){
sosuu = 0;
break;
}
}
return sosuu;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CgovL+mWouaVsOOBruODl+ODreODiOOCv+OCpOODl+Wuo+iogAp2b2lkIGdvbGRiYWNoKGludCBuKTsKdm9pZCBwcmludChpbnQgYSwgaW50IGIpOwppbnQgcHJpbWUoaW50IG4pOwoKLy9tYWlu6Zai5pWwCmludCBtYWluKHZvaWQpewogICAgaW50IGE7CgogICAgc2NhbmYoIiVkIiwgJmEpOwogICAgZ29sZGJhY2goYSk7CgogICAgcmV0dXJuIDA7Cn0KCi8vIOOCtOODvOODq+ODieODkOODg+ODj+S6iOaDswp2b2lkIGdvbGRiYWNoKGludCBuKXsKICAgIGludCBpOwogICAgZm9yKGkgPSAyOyBpIDw9IG4vMjsgaSsrKXsKICAgICAgICBpZihwcmltZShpKSAmJiBwcmltZShuIC0gaSkpewogICAgICAgICAgICBwcmludChpLCBuIC0gaSk7CiAgICAgICAgfQogICAgfQp9CgovL+e1kOaenOihqOekugp2b2lkIHByaW50KGludCBhLCBpbnQgYil7CiAgICBzdGF0aWMgaW50IGNvdW50ID0gMDsKICAgIGNvdW50Kys7CiAgICBwcmludGYoIiUyZDogJWQgPSAlZCArICVkXG4iLCBjb3VudCwgYStiLCBhLCBiKTsKfQoKLy/ntKDmlbDliKTlrpoKaW50IHByaW1lKGludCBuKXsKICAgIGludCBpOwogICAgaW50IHNvc3V1ID0gMTsKCiAgICBmb3IoaT0yOyBpPG47IGkrKyl7CiAgICAgICAgaWYobiVpPT0wKXsKICAgICAgICAgICAgc29zdXUgPSAwOwogICAgICAgICAgICBicmVhazsKICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gc29zdXU7Cn0K