#include<bits/stdc++.h>
using namespace std;
int main(){
	cout<<"6=3+3"<<endl<<"8=3+5"<<endl<<"10=3+7"<<endl<<"12=5+7"<<endl<<"14=3+11"<<endl<<"16=3+13"<<endl<<"18=5+13"<<endl<<"20=3+17"<<endl<<"22=3+19"<<endl<<"24=5+19"<<endl<<"26=3+23"<<endl<<"28=5+23"<<endl<<"30=7+23"<<endl<<"32=3+29"<<endl<<"34=3+31"<<endl<<"36=5+31"<<endl<<"38=7+31"<<endl<<"40=3+37"<<endl<<"42=5+37"<<endl<<"44=3+41"<<endl<<"46=3+43"<<endl<<"48=5+43"<<endl<<"50=3+47"<<endl<<"52=5+47"<<endl<<"54=7+47"<<endl<<"56=3+53"<<endl<<"58=5+53"<<endl<<"60=7+53"<<endl<<"62=3+59"<<endl<<"64=3+61"<<endl<<"66=5+61"<<endl<<"68=7+61"<<endl<<"70=3+67"<<endl<<"72=5+67"<<endl<<"74=3+71"<<endl<<"76=3+73"<<endl<<"78=5+73"<<endl<<"80=7+73"<<endl<<"82=3+79"<<endl<<"84=5+79"<<endl<<"86=3+83"<<endl<<"88=5+83"<<endl<<"90=7+83"<<endl<<"92=3+89"<<endl<<"94=5+89"<<endl<<"96=7+89"<<endl<<"98=19+79"<<endl<<"100=3+97"<<endl ;
	return 0;
}
//致敬传奇打表王

#include<bits/stdc++.h>
using namespace std;

bool ss(int x){
	for(int i=2;i<=x/2;i++){
		if(x%i==0) return false;
	}
	return true;
}
int main(){
	for(int i=6;i<=100;i++){
		for(int j=3;j<=i-3;j++){
			if(ss(j)){
				if(ss(i-j)){
					cout<<i<<"="<<j<<"+"<<i-j<<endl;
					break;
				}
			}
		}
	}
	return 0;
}

写完代码发现自己看不懂了

#include<bits/stdc++.h>
using namespace std;
int test(int n){
	if(n==2|n==3){
		return 1;
	}
	for(int i=2;i<=sprt(n);i++){
		if(n%i==0){
			return 0;
		} 
	}
}
int main(){
	int a[48];
	for(int i=0;i<45;i++){
		a[i]=6+2*i;
//		cout<<a[i]<<" ";This sentence can be used to test the set of number is correct or not.
	}
	int p,q=0;
	for(int i=0;i<48;i++){
		for(int j=2;j<=a[i]/2;j++){
			p=j;
			q=a[i]=j;
			if(test(p)&&test(q)){
				cout<<a[i]<<"="<<p<<"+"<<q<<endl<<endl;//According to the question,you need to add two "endl".
				break;
			}
		}
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
bool su(int n){
	for (int i = 2;i < n;i++){
		if (n % i == 0){
			return 0;
		}
		
	}return 1;
}
int main(int argc, char **argv){
	for (int i = 6;i <= 100;i += 2){
		for (int j = 3;j <= i / 2;j += 2){
			if(su(j) && su(i - j)){
				printf("%d=%d+%d\n",i,j,i - j);
				break;
			}
		}
	}
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
bool su(int n)
{
	for (int i = 2;i < n;i++)//判断素数
	{
		if (n % i == 0)
		
		{
			return false;
		}
		
	}return true;
}
int main()
{
	for (int i = 6;i <= 100;i += 2)
	{
		for (int j = 3;j <= i / 2;j += 2)
		{
			if(su(j) && su(i - j))//判断 
			{
				printf("%d=%d+%d\n",i,j,i - j);
				break;
			}
		}
	}
	return 0;
}
//#include<bits/stdc++.h>
//using namespace std;
///int main(){
//	cout<<"6=3+3"<<endl<<"8=3+5"<<endl<<"10=3+7"<<endl<<"12=5+7"<<endl<<"14=3+11"<<endl<<"16=3+13"<<endl<<"18=5+13"<<endl<<"20=3+17"<<endl<<"22=3+19"<<endl<<"24=5+19"<<endl<<"26=3+23"<<endl<<"28=5+23"<<endl<<"30=7+23"<<endl<<"32=3+29"<<endl<<"34=3+31"<<endl<<"36=5+31"<<endl<<"38=7+31"<<endl<<"40=3+37"<<endl<<"42=5+37"<<endl<<"44=3+41"<<endl<<"46=3+43"<<endl<<"48=5+43"<<endl<<"50=3+47"<<endl<<"52=5+47"<<endl<<"54=7+47"<<endl<<"56=3+53"<<endl<<"58=5+53"<<endl<<"60=7+53"<<endl<<"62=3+59"<<endl<<"64=3+61"<<endl<<"66=5+61"<<endl<<"68=7+61"<<endl<<"70=3+67"<<endl<<"72=5+67"<<endl<<"74=3+71"<<endl<<"76=3+73"<<endl<<"78=5+73"<<endl<<"80=7+73"<<endl<<"82=3+79"<<endl<<"84=5+79"<<endl<<"86=3+83"<<endl<<"88=5+83"<<endl<<"90=7+83"<<endl<<"92=3+89"<<endl<<"94=5+89"<<endl<<"96=7+89"<<endl<<"98=19+79"<<endl<<"100=3+97"<<endl ;
//	return 0;
//}

#include<bits/stdc++.h>
using namespace std;
bool isPrime(int n)//判断大于等于2的n是否是质数 
{
	for(int i = 2; i <= sqrt(n); ++i)
		if(n % i == 0)
			return false;
	return true;
}
int main()
{
    for(int i = 6; i <= 100; i += 2)//遍历6~100的每个偶数 
    {
    	for(int j = 2; j <= i/2; ++j)
		{
			if(isPrime(j) && isPrime(i-j))
			{
				cout << i << '=' << j << '+' << i - j << endl;
				break;
			}
		}
	}
    return 0;
}

`

#include <cstdio>
#include <algorithm>
using namespace std;
bool is_prime(int x)
{
	for(int i = 2;i * i <= x;i++)
	{
		if(x % i == 0)
			return false;
	}
	return true;
}
void write(int a){

for(int i = 3;i + 2 <= a;i += 2)
{
	if(is_prime(i) && 2 + i == a)
	{
		printf("%d=2+%d\n",a,i);
		return;
	}
}
for(int i = 3;i + 3 <= a;i += 2)
{
	if(is_prime(i) && is_prime(a - i))
	{
		printf("%d=%d+%d\n",a,min(i,a - i),max(i,a - i));
		return;
	}
}

} int n = 100; int main() { for(int i = 4;i <= n;i += 2) write(i); return 0; }

#include<bits/stdc++.h> using namespace std; bool Prime(int n){ if(n<=1){ return false; } else{ for(int i=2;i<=sqrt(n);i++){ if(n%i==0){ return false; } } }

return true;

} void Godbahh(int n){ for(int i=0;i<n;i++){ if(Prime(i)==true&&Prime(n-i)==true){ cout<<n<<"="<<i<<"+"<<n-i<<endl; return; } } } int main(){ for(int i=6;i<=100;i+=2) Godbahh(i);

return 0;

}