实验一-程序6-信管3班33号-崔恒.cpp

6~200内每个偶数的素数分解 略做修改可以输出任意数偶数内的素数分解.

#include <iostream.h>

bool prime6(int n)
{
	int m=2;
	for(; m * m <= n; m++)
	{
		if(n%m == 0) return 0;		
	}
    return 1;
};

void main()
{
	int x,y;
	int k=0;
	
	for(x = 6; x<=100;x+=2)
	   {for (y = 3; y<=x/2; y+=2)
			if(prime6(y) && prime6(x-y))
			{k++;
				cout<<x<<"="<<y<<"+"<<x-y<<"         ";
			if (k % 4 == 0) cout<<endl;
            }
	      
	}
    
    cout<<endl<<"结束"<<endl;

}