cf---A. Design Tutorial: Learn from Math

One way to create a task is to learn from math. You can generate some random math statement or modify some theorems to get something new and build a new task from that.

For example, there is a statement called the “Goldbach’s conjecture”. It says: “each even number no less than four can be expressed as the sum of two primes”. Let’s modify it. How about a statement like that: “each integer no less than 12 can be expressed as the sum of two composite numbers.” Not like the Goldbach’s conjecture, I can prove this theorem.

You are given an integer n no less than 12, express it as a sum of two composite numbers.

Input
The only line contains an integer n (12 ≤ n ≤ 106).

Output
Output two composite integers x and y (1 < x, y < n) such that x + y = n. If there are multiple solutions, you can output any of them.

AC代码

#include<bits/stdc++.h>
using namespace std;
bool judge(int x)
{
	int i;
	for(i=2;i<x;i++)
		{
			if(x%i==0)
			{
				return true;
			}
		}
		if(i==x)
		return false;
}
int main()
{
	int n;
	cin>>n;
	int x;
	for(x=4;;x++)
	{
		if(judge(x)&&judge(n-x))
		{
			break;
		}
	}
	cout<<x<<" "<<n-x;
	return 0;
}

思想:判断不是两个数不是素数，找到两个数的联系，判断素数最好利用方法来判断。而不是全部在main方法里面。