Made a mathematical calculation simulator , Run through , Can be compiled directly .

Exquisite Homepage ...

ha-ha ......

Look at the code
#include<bits/stdc++.h> #include<windows.h> #include<conio.h> using namespace
std; int s=0;int m,n;int a[100]; long long math_z(long long temp) { long long
u=1; for (int i=1;i<=temp;i++) { u*=i; } return u; } void init() {
system("color F0"); cout<<"\n\t\t\t ____________________\n"; cout<<"\t\t\t |
|\n"; cout<<"\t\t\t | Permutation and combination simulator |\n"; cout<<"\t\t\t | Press lowercase a Enter permutation |\n";
cout<<"\t\t\t | Press lowercase b Enter combination |\n"; cout<<"\t\t\t | Press lowercase d Enter Division |\n"; cout<<"\t\t\t |
Press lowercase c sign out |\n"; cout<<"\t\t\t ---------------------\n"; } double d(double g,
double h)//a=g b=h { if(h==0) { throw "Division by zero condition!Please
continue to choose."; } return (g*1.0/h*1.0); } void init_2() { system("mode
con cols=80 lines=20"); //1 system("color F4"); cout<<"\n\n"; cout<<" ("<<endl;
cout<<" )))"<<endl; cout<<" ((((("<<endl; cout<<" )))))))"<<endl; cout<<"
(((((((((("<<endl; cout<<" ))))))))))))))"<<endl; cout<<"
(((((((((((((((("<<endl; cout<<")))))))))()))))))))"<<endl;
cout<<"(((((((((((())(((((((((("<<endl; cout<<" ))))))(((())))))))))"<<endl;
cout<<"(((((((((())(((((((((("<<endl; cout<<")))))))))))))))))())))))"<<endl;
Sleep(1000); system("cls"); //2 cout<<"\n\n"; cout<<" ("<<endl; cout<<"
)))"<<endl; cout<<" ((((("<<endl; cout<<" )))))))"<<endl; cout<<"
(((((((((("<<endl; cout<<" ))))))))))))))"<<endl; cout<<"
(((((((((((((((("<<endl; cout<<" )))))))))()))))))))"<<endl; cout<<"
(((((((((((())(((((((((("<<endl; cout<<" ))))))(((())))))))))"<<endl; cout<<"
(((((((((())(((((((((("<<endl; cout<<" )))))))))))))))))())))))"<<endl;
Sleep(1000); system("cls"); //2 cout<<"\n\n"; cout<<" ("<<endl; cout<<"
)))"<<endl; cout<<" ((((("<<endl; cout<<" )))))))"<<endl; cout<<"
(((((((((("<<endl; cout<<" ))))))))))))))"<<endl; cout<<"
(((((((((((((((("<<endl; cout<<" )))))))))()))))))))"<<endl; cout<<"
(((((((((((())(((((((((("<<endl; cout<<" ))))))(((())))))))))"<<endl; cout<<"
(((((((((())(((((((((("<<endl; cout<<" )))))))))))))))))())))))"<<endl;
Sleep(1000); system("cls"); //2 cout<<"\n\n"; cout<<" ("<<endl; cout<<"
)))"<<endl; cout<<" ((((("<<endl; cout<<" )))))))"<<endl; cout<<"
(((((((((("<<endl; cout<<" ))))))))))))))"<<endl; cout<<"
(((((((((((((((("<<endl; cout<<" )))))))))()))))))))"<<endl; cout<<"
(((((((((((())(((((((((("<<endl; cout<<" ))))))(((())))))))))"<<endl; cout<<"
(((((((((())(((((((((("<<endl; cout<<" )))))))))))))))))())))))"<<endl;
Sleep(1000); system("cls"); //2 cout<<"\n\n"; cout<<" ("<<endl; cout<<"
)))"<<endl; cout<<" ((((("<<endl; cout<<" )))))))"<<endl; cout<<"
(((((((((("<<endl; cout<<" ))))))))))))))"<<endl; cout<<"
(((((((((((((((("<<endl; cout<<" )))))))))()))))))))"<<endl; cout<<"
(((((((((((())(((((((((("<<endl; cout<<" ))))))(((())))))))))"<<endl; cout<<"
(((((((((())(((((((((("<<endl; cout<<" )))))))))))))))))())))))"<<endl;
cout<<"\n number "; Sleep(100); cout<<" learn "; Sleep(100); cout<<" meter "; Sleep(100);
cout<<" count "; Sleep(100); cout<<" model "; Sleep(100); cout<<" Draft "; Sleep(100); cout<<" implement ";
Sleep(2000); system("cls"); } int P(int k) { if(k>m) // If k Than m If it is longer, stop recursion return
s; for(int i=1;i<=n;i++) { a[k]=i; int flag=0; for(int j=1;j<=k-1;j++) // Here means
Every bit, for example 2 position To test n number , Don't do what appears in front . { if(a[k]==a[j]) { flag=1; break; } } if(flag==0)
//flag==1 Indicates that the previous number has been used , It won't work . { if(k==m) // When k It's the third day m position , Then you have to output this full array { for(int
i=1;i<=m;i++) { printf("%d",a[i]); } printf("\n"); s++; //s Count the number of permutations } else
P(k+1); //k Not yet m position , Then keep looking for the next one . } } } int main() { init_2(); Sleep(5000);
//system("cls"); init(); int ch; while (true) { if (kbhit()){ ch = _getch(); if
(ch == 98) {
cout<<endl<<" combination ： Please enter C(m,n)( In Mathematics m On ,n Under ) Medium n and m( Lose first n Lose again m), Direct results , How many results are there "; long long
a,b; cin>>a>>b;//n=a m=b
cout<<" Altogether "<<math_z(a)/(math_z(b)*math_z(a-b))<<" Two combinations "; } if (ch == 97) {
cout<<endl<<" combination ： Please enter A(m,n)( In Mathematics m On ,n Under ) Medium n and m( Lose first n Lose again m), Direct results , How many results are there "; int P(int
k); //k from 1 Until m ,k Represents the second row of the arrangement k number cin>>n>>m; //P(1);
cout<<endl<<" Altogether "<<s<<" Arrangement method "; } if (ch==99) { cout<<"\n\n"; system("pause");
exit(0); } if (ch==100) { double z=0; cout<<endl<<" Enter two numbers ："; double x; double y;
cin>>x>>y; cout<<endl<<" Please enter the number of decimal places to keep ( most 4 position )"<<endl; int r; cin>>r; try{ z =
d(x,y); cout<<endl<<x<<" / "<<y<<" ~= "<<fixed<<setprecision(r)<<z<<endl;
}catch (const char* msg){ cerr<<msg<<endl; } } } } return 0; }

Technology
Daily Recommendation
views 1