java³ÌÐòÉè¼ÆÊµÓÃ½Ì³Ì (µÚ3°æ) Ò¶ºËÑÇ Ï°Ìâ´ð°¸ ËùÓдð°¸1¡ª12Õ ÏÂÔØ±¾ÎÄ

static int[] prime=null; //´æ·ÅËØÊýµÄһάÊý×é

static int number; //ËØÊý¸öÊý£¬¼´Êý×éµÄʵ¼ÊÔªËØ¸öÊý

public Goldbach(int n)

//Êä³önµÄ¸çµÂ°ÍºÕËãʽ

{

if (prime==null) init();

if (n%2==0) //żÊý

{

int i=0;

while (i

if (isPrime(n-prime[i]))

System.out.print(n+\ \ i++; } }

else //ÆæÊý

{

int i=0;

while (i

int j=i; //Èç¹ûj=0£¬Ôò»á³öÏÖÖØ¸´µÄËãʽ

while (j

if (isPrime(n-prime[i]-prime[j]))

System.out.print(n+\ +(n-prime[i]-prime[j])+\ j++; } i++; } }

System.out.println(); }

public static void init() //³õʼ»¯Êý×飬ɸѡ·¨ÇóËØÊý {

prime = new int[30];

prime[0]=2; //ÒÑÖªµÄ×îÐ¡ËØÊý number=1; //ËØÊý¸öÊý

int i=1; //ÏÂÒ»¸öËØÊýÓ¦´æ·ÅµÄÊý×éϱêλÖà int k=3; //´Ó×îÐ¡ÆæÊý¿ªÊ¼²âÊÔ£¬ËùÓÐżÊý²»Ðè²âÊÔ

do {

int j=0;

while ((j

if (j==number) //kÊÇËØÊý

{

prime[i]=k; //½«kÌí¼Óµ½Êý×éprimeÖÐ i++;

number++; }

k+=2; //²âÊÔÏÂÒ»¸öÆæÊýÊÇ·ñÊÇËØÊý } while(k

public static void output() //Êä³öËØÊý {

System.out.println(\ for (int i=0;i

System.out.print(\ \ if ((i+1)==0)

System.out.println(); //ÿÐÐд10¸öÊý

}

System.out.println(\ }

public static boolean isPrime(int k) //ÅжÏkÊÇ·ñÎªËØÊý£¬¼´ÔÚprimeÖвéÕÒkÖµ {

boolean yes=false; int i=0;

while (!yes && i<=number && prime[i]<=k) if (prime[i]==k) yes=true; else i++; return yes; }

public static void main(String args[]) {

for(int i=4;i

for(int i=7;i

³ÌÐòÔËÐнá¹ûÈçÏ£º

All primes in 2~30 are: 2 3 5 7 11 13 17 19 23 29 number=10 żÊý

4=2+2 6=3+3 8=3+5

10=3+7 10=5+5 12=5+7

14=3+11 14=7+7 16=3+13 16=5+11 18=5+13 18=7+11 20=3+17 20=7+13

22=3+19 22=5+17 22=11+11 24=5+19 24=7+17 24=11+13 26=3+23 26=7+19 26=13+13 28=5+23 28=11+17 ÆæÊý

7=2+2+3

9=2+2+5 9=3+3+3 11=2+2+7 11=3+3+5 13=3+3+7

15=2+2+11 15=3+5+7 15=5+5+5 17=2+2+13 17=3+3+11 17=5+5+7 19=3+3+13 19=3+5+11

21=2+2+17 21=3+5+13 21=3+7+11 21=5+5+11 21=7+7+7 23=2+2+19 23=3+3+17 23=3+7+13 23=5+5+13 23=5+7+11 25=3+3+19 25=3+5+17 25=5+7+13 25=7+7+11

27=2+2+23 27=3+5+19 27=3+7+17 27=5+5+17 27=7+7+13 29=3+3+23 29=3+7+19 29=5+5+19 29=5+7+17 ²»ÄÜÓÐÖØ¸´±í´ïʽ£¬ÀýÈç

19=3+3+13 19=3+5+11 19=5+3+11

21=2+2+17 21=3+5+13 21=3+7+11 21=5+3+13 21=5+5+11 21=7+3+11 21=7+7+7

14£®JavaµÄÊý×é±ÈC++µÄÊý×éÓÐÄÄЩÓÅÔ½Ö®´¦£¿

¡¾´ð¡¿JavaÓïÑÔ²»Ö§³ÖC++µÄÖ¸ÕëÀàÐÍ£¬¶ÔÊý×éµÄ²Ù×÷Ö»Äܰ´ÕÕÊý×鷽ʽ£¬²»ÄÜʹÓÃÖ¸Õë¡£JavaµÄÊý×é¶¼ÊǶ¯Ì¬Êý×飬²¢ÇÒÊÇÒýÓÃÊý¾ÝÀàÐÍ£¬Ìá¸ßÁ˰²È«ÐԺͼòµ¥ÐÔ¡£ÁíÍ⣬JavaÓïÑÔ¾ßÓÐ×ÊÔ´»ØÊÕ»úÖÆ£¬Äܹ»×Ô¶¯Êջز»ÔÙʹÓõÄ×ÊÔ´£¬Ò»°ãÇé¿öϳÌÐò²»ÐèÒª¹é»¹Êý×éËùÕ¼

µÄÄÚ´æ¿Õ¼ä¡£

15£®×÷ΪÒýÓÃÊý¾ÝÀàÐÍ£¬Êý×é±äÁ¿Óë»ù±¾Êý¾ÝÀàÐ͵ıäÁ¿Ê¹ÓÃʱÓÐÄÄÐ©Çø±ð£¿

¡¾´ð¡¿Êý×é±äÁ¿Óë»ù±¾Êý¾ÝÀàÐͱäÁ¿²»Í¬µãÔÚÓÚ£¬´æ´¢µ¥ÔªµÄ·ÖÅ䷽ʽ²»Í¬£¬Á½¸ö±äÁ¿Ö®¼äµÄ¸³Öµ·½Ê½Ò²²»Í¬¡£»ù±¾Êý¾ÝÀàÐͱäÁ¿»ñµÃ´æ´¢µ¥ÔªµÄ·½Ê½ÊǾ²Ì¬µÄ£¬ÉùÃ÷Á˱äÁ¿ºóϵͳ¾ÍΪ±äÁ¿·ÖÅäÁË´æ´¢µ¥Ôª£¬¾Í¿ÉÒÔ¶Ô±äÁ¿¸³Öµ¡£Á½¸ö±äÁ¿Ö®¼äµÄ¸³ÖµÊÇÖµ±¾Éí¡£ Êý×é±äÁ¿µÄÒýÓø³Öµ£¬Êý×é±äÁ¿±£´æµÄÊÇÊý×éµÄÒýÓ㬼´Êý×éÕ¼ÓõÄһƬÁ¬Ðø´æ´¢¿Õ¼äµÄÊ×µØÖ·¼°³¤¶ÈÌØÐÔ¡£µ±ÉùÃ÷Ò»¸öÊý×Ö±äÁ¿¶øÎ´ÉêÇë¿Õ¼äʱ£¬±äÁ¿ÊÇδ³õʼ»¯µÄ£¬Ã»ÓеØÖ·¼°ÌØÐÔÖµ¡£Ö»ÓÐÉêÇëÁË´æ´¢¿Õ¼ä£¬²ÅÄÜÒÔϱê±íʾÊý×éÔªËØ¡£

16£®ÇóÒ»×éÊýÖеÄ×î´óÖµºÍ×îСֵ¡£ ¡¾´ð¡¿³ÌÐòÈçÏ£º

public class Zuizhi { public static void main(String[] args) { // TODO ×Ô¶¯Éú³É·½·¨´æ¸ù

int array[]=new int[100];

for(int i=1;i<=30;++i)//³õʼ»¯Êý×é array[i]=i;

int max=array[1];//±£´æ×î´óÖµ int min=array[1];//±£´æ×îСֵ

for(int j=2;j<=30;++j) { max=Math.max(max, array[j]); min=Math.min(min, array[j]); }

System.out.println(\¸ÃÊý×é×î´óֵΪ£º\System.out.println(\¸ÃÊý×é×îСֵΪ£º\

} }

ÔËÐнá¹ûÈçÏ£º ¸ÃÊý×é×î´óֵΪ£º30 ¸ÃÊý×é×îСֵΪ£º1

17£®²ÉÓÃһάÊý×éÊä³öÑî»ÔÈý½ÇÐΡ£

³ÌÐòÈçÏ£º

public class Yanghui1 {

public static void main(String args[]) {

int n=10; //n±íʾÐÐÊý int[] table = new int[n+1];

table[0]=1; //ÿÐеÚ1¸öÊý¶¼Îª1 for (int i=1;i<=n;i++) //¿ØÖÆÊä³önÐÐ