Prepared with the following function prototype prime, used to determine whether an integer n prime numbers: bool prime (int n) before the preparation of the main function, indiscriminate importation of a greater than 4, even d, to find out to satisfy d = d1+ D2 all the number of , which calls for d1 and d2 are prime numbers (by calling the prime to determine prime numbers). If even 18 can be decomposed into 11+ 7 and 13+ 5 and even 80 can be decomposed into: 43+ 37,612 B! 19,672 B! 13,732 B! 7. Tip: i with di and exactly even d, and only when i and di are odd when they may become the order of a few of.

shiyan12
........\Debug
........\prime.cpp
........\prime.dsp
........\prime.dsw
........\prime.ncb
........\prime.opt
........\prime.plg

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．