菜单的建立（Menu creation）.docVIP

菜单的建立（Menu creation） # iostream # string #includemath h # cmath using namespace Std; void menu (); void Yuan (); void HS (); void Max (); void FD (); void Sz (); void bonus (); void Gygb (); void Sn (); void DD (); void pic (); void NEC (); void Tx (int x, int y, int z); void Ox (int x, int y); void Tchs (); int JC (int x); void sum (); void Sinh (); void Nddd (); double nd (int a, int b, int c, int d, double x); void Gdbh (); int SS (int x); void Lrd (); Double dglrd (double x, double n); int dgpfh (int x); void Pfh (); void Sjx (); void Exchange (int a); int main (int argc, char *argv[]) { System (Color F0); int a=1; menu (); while (A! $number) { cout Please enter the serial number of the subject to be checked ENDL; Cina; Switch (a) { Case 1: yuan (); Case 2: HS (); Case 3: Max (); Case 4: FD (); Case 5: SZ (); Case 6: Bonus (); Case 7: GYGB (); Case 8: SN (); Case 9: DD (); Case ten: Pic (); Case by Case: Tchs (); Case: sum (); Case: Sinh (); Case: nddd (); Case: GDBH (); Case: Lrd (); Case: PFH (); Case: SJX (); Case: NEC (); Default: cout Query content is not in service, please re-enter ENDL; } } return 0; } void menu () { cout ┌──────────── Wen Juns after-school exercises 34th unit operation ──────────┐ ENDL; cout │1. Calculations related to the Circle 2. Fahrenheit temperature conversion to 3 degrees Celsius. The maximum number of three number │ ENDL; cout │4. The Piecewise function solves 5. Number of digits and inverse input 6. Number of bonuses received │ ENDL; cout │7. The Convention is 8 times the public. The first N and 9 of the special series. Iterative method to find square root │ ENDL; cout │10. Special pattern Input 11. Two times function Solution 12. Different number of factorial summation │ ENDL; cout │13. Hyperbolic sine function 14. Newton Iterative method to find root 15. Goldbach conjecture (fragment) │ ENDL; cout │16. Legendre recursive solution 17. The first n squared sum is solved by 18. Three sides of the triangle are known to find new Are