題目描述:

代碼示例:

#include <bits/stdc++.h>
using namespace std; int main(){
//	算法思想1:遍歷小于該偶數(shù)的所有素數(shù),存入數(shù)組中,遍歷數(shù)組找出兩個數(shù)之和等于偶數(shù)的數(shù)int n;cout << "輸入樣例" << endl;cin >> n;int nums[n];int k = 0;for(int i = 2; i <= n; i++){bool tag = true;for(int j = 2; j <= sqrt(i); j++){if(i % j == 0){tag = false;break;}}if(tag == true){nums[k++] = i;}} //	for(int i = 0; i < k; i++){
//		cout << nums[i] << " ";
//	}//測試素數(shù)結(jié)果cout << "輸出樣例" << endl;for(int i = 0; i < k; i++){for(int j = i; j < k; j++){if(nums[i] + nums[j] == n){cout << nums[i] << " " << nums[j] << " " << endl;}}} return 0;
}

運行結(jié)果: