新的画大饼公告预加入几何功能已修bug平方变负数负数平方会崩小数取模卡死未修bug:暂时从来没人说呜呜稳定版功能少bug少#include bits/stdc.h #include windows.h using namespace std; // 分数有理数类 struct Fraction { long long num, den; Fraction(long long n0,long long d1):num(n),den(d) { if(den0) { num0; den1; return; } if(den0) { num-num; den-den; } long long ggcd(abs(num),den); num/g; den/g; } static long long gcd(long long a,long long b) { return b0?a:gcd(b,a%b); } double toDouble() const { return (double)num/den; } }; Fraction operator(const Fraction a,const Fraction b) { return Fraction(a.num*b.dena.den*b.num,a.den*b.den); } Fraction operator-(const Fraction a,const Fraction b) { return Fraction(a.num*b.den-a.den*b.num,a.den*b.den); } Fraction operator*(const Fraction a,const Fraction b) { return Fraction(a.num*b.num,a.den*b.den); } Fraction operator/(const Fraction a,const Fraction b) { return Fraction(a.num*b.den,a.den*b.num); } Fraction operator(Fraction a,const Fraction b) { aab; return a; } Fraction operator-(Fraction a,const Fraction b) { aa-b; return a; } Fraction operator*(Fraction a,const Fraction b) { aa*b; return a; } Fraction operator/(Fraction a,const Fraction b) { if(b.num0) { cout谁让你除以0的?; Sleep(1000); aFraction(0); return a; } aa/b; return a; } Fraction operator%(Fraction a,const Fraction b) { if(b.num0) { cout谁让你%0的?; Sleep(1000); aFraction(0); return a; } if(a.den!1||b.den!1) { cout取模仅支持整数!; Sleep(1000); aFraction(0); return a; } aFraction(a.num%b.num); return a; } bool operator(const Fraction a,const Fraction b) { return a.numb.numa.denb.den; } ostream operator(ostream out,const Fraction f) { if(f.den1) outf.num; else outf.num/f.den; return out; } string s; int pos; long long SToi(string s) { long long k0; for(int i0;is.size();i)k*10,ks[i]-0; return k; } string itos(int x) { if(x0)return 0; string s; while(x) { sx%100;x/10; } reverse(s.begin(),s.end()); return s; } Fraction expr(); Fraction term(); Fraction factor(); Fraction factor() { while(poss.size() s[pos] )pos; if(poss.size())return Fraction(0); Fraction val; if(s[pos](||s[pos][||s[pos]{) { char opens[pos]; char close(open(?):(open[?]:})); pos; valexpr(); if(poss.size()s[pos]close)pos; } else if(s[pos]||s[pos]-) { int f(s[pos]-)?-1:1; pos; return f*factor(); } else { string num; bool dotfalse; while(poss.size()(isdigit(s[pos])||(s[pos].!dot))) { if(s[pos].)dottrue; nums[pos]; } if(!dot) { valFraction(SToi(num)); } else { long long a0,b0,den1; int i0; while(inum.size()num[i]!.) { aa*10num[i]-0; i; } i; while(inum.size()) { bb*10num[i]-0; den*10; i; } valFraction(a*denb,den); } } while(poss.size()) { while(poss.size() s[pos] )pos; if(poss.size()||s[pos]!^)break; pos; Fraction expfactor(); if(exp.den!1) { cout指数必须为整数!; Sleep(1000); return Fraction(0); } long long eexp.num; if(val.num0 e0) { cout0不能有负指数!; Sleep(1000); return Fraction(0); } bool nege0; unsigned long long nneg?-static_castunsigned long long(e):static_castunsigned long long(e); Fraction res(1); Fraction baseval; while(n) { if(n1)resres*base; basebase*base; n1; } if(neg)resFraction(1)/res; valres; } return val; } Fraction term() { Fraction leftfactor(); while(poss.size()) { while(poss.size() s[pos] )pos; if(poss.size())break; char ops[pos]; if(op!* op!/ op!%)break; pos; Fraction rightfactor(); if(op*)left*right; else if(op/) { if(right.num0) { cout谁让你除以0的?; Sleep(1000); return Fraction(0); } left/right; } else { if(right.num0) { cout谁让你%0的?; Sleep(1000); return Fraction(0); } left%right; } } return left; } Fraction expr() { Fraction leftterm(); while(poss.size()) { while(poss.size() s[pos] )pos; if(poss.size())break; char ops[pos]; if(op! op!-)break; pos; Fraction rightterm(); if(op)leftright; else left-right; } return left; } void normal() { system(cls); cout普通\n; cin.ignore(numeric_limitsstreamsize::max(), \n); getline(cin,s); pos0; Fraction ansexpr(); coutans; if(ans.den!1)cout ≈ ans.toDouble(); cout\n按下任意键继续……; string keyudong_niubi; cinkeyudong_niubi; system(cls); } void code(int a,int b) { //施工中……………… } void shuoming() { system(cls); cout目前支持 - * / % () [] {} ^支持小数和分数还能互相转换endl; cout作者keyudong,洛谷名keyudong,目前许多功能需↗要↘改↗进↘如有BUG和意见欢~迎~指~出~endl; cout转载请注明出处及作者点个赞把QWQ; Sleep(3500); } int main() { while(1) { system(cls); cout-寄蒜气- 1.2endl; cout1普通endl; cout2程序员endl; cout3说明endl; string c; cinc; if(c1)normal(); //if(c2)//code(); if(c3)shuoming(); if(c4)cout恭喜你发现了什么用也没有的彩↗蛋↘。; Sleep(250); system(cls); } return 0; }//使用愉快qwq最新功能多bug可能多#include bits/stdc.h #include windows.h using namespace std; // 分数有理数类 struct Fraction { long long num, den; Fraction(long long n0,long long d1):num(n),den(d) { if(den0) { num0; den1; return; } if(den0) { num-num; den-den; } long long ggcd(abs(num),den); num/g; den/g; } static long long gcd(long long a,long long b) { return b0?a:gcd(b,a%b); } double toDouble() const { return (double)num/den; } }; Fraction operator(const Fraction a,const Fraction b) { return Fraction(a.num*b.dena.den*b.num,a.den*b.den); } Fraction operator-(const Fraction a,const Fraction b) { return Fraction(a.num*b.den-a.den*b.num,a.den*b.den); } Fraction operator*(const Fraction a,const Fraction b) { return Fraction(a.num*b.num,a.den*b.den); } Fraction operator/(const Fraction a,const Fraction b) { return Fraction(a.num*b.den,a.den*b.num); } Fraction operator(Fraction a,const Fraction b) { aab; return a; } Fraction operator-(Fraction a,const Fraction b) { aa-b; return a; } Fraction operator*(Fraction a,const Fraction b) { aa*b; return a; } Fraction operator/(Fraction a,const Fraction b) { if(b.num0) { cout谁让你除以0的?; Sleep(1000); aFraction(0); return a; } aa/b; return a; } Fraction operator%(Fraction a,const Fraction b) { if(b.num0) { cout谁让你%0的?; Sleep(1000); aFraction(0); return a; } if(a.den!1||b.den!1) { cout取模仅支持整数!; Sleep(1000); aFraction(0); return a; } aFraction(a.num%b.num); return a; } bool operator(const Fraction a,const Fraction b) { return a.numb.numa.denb.den; } ostream operator(ostream out,const Fraction f) { if(f.den1) outf.num; else outf.num/f.den; return out; } string s; int cnt; long long SToi(string s) { long long k0; for(int i0;is.size();i)k*10,ks[i]-0; return k; } string itos(int x) { if(x0)return 0; string s; while(x) { sx%100;x/10; } reverse(s.begin(),s.end()); return s; } Fraction expr(); Fraction term(); Fraction factor(); Fraction factor() { while(cnts.size() s[cnt] )cnt; if(cnts.size())return Fraction(0); Fraction v; if(s[cnt](||s[cnt][||s[cnt]{) { char opens[cnt]; char close(open(?):(open[?]:})); cnt; vexpr(); if(cnts.size()s[cnt]close)cnt; } else if(s[cnt]||s[cnt]-) { int f(s[cnt]-)?-1:1; cnt; return f*factor(); } else { string num; bool dotfalse; while(cnts.size()(isdigit(s[cnt])||(s[cnt].!dot))) { if(s[cnt].)dottrue; nums[cnt]; } if(!dot) { vFraction(SToi(num)); } else { long long a0,b0,den1; int i0; while(inum.size()num[i]!.) { aa*10num[i]-0; i; } i; while(inum.size()) { bb*10num[i]-0; den*10; i; } vFraction(a*denb,den); } } while(cnts.size()) { while(cnts.size() s[cnt] )cnt; if(cnts.size()||s[cnt]!^)break; cnt; Fraction expfactor(); if(exp.den!1) { cout指数得是整数!; Sleep(1000); return Fraction(0); } long long eexp.num; if(v.num0 e0) { cout0 不能have负指数!; Sleep(1000); return Fraction(0); } bool nege0; unsigned long long nneg?-static_castunsigned long long(e):static_castunsigned long long(e); Fraction ac(1); Fraction basev; while(n) { if(n1)acac*base; basebase*base; n1; } if(neg)acFraction(1)/ac; vac; } return v; } Fraction term() { Fraction kfactor(); while(cnts.size()) { while(cnts.size() s[cnt] )cnt; if(cnts.size())break; char ops[cnt]; if(op!* op!/ op!%)break; cnt; Fraction rfactor(); if(op*)k*r; else if(op/) { if(r.num0) { cout谁让你除以0的?; Sleep(1000); return Fraction(0); } k/r; } else { if(r.num0) { cout谁让你%0的?; Sleep(1000); return Fraction(0); } k%r; } } return k; } Fraction expr() { Fraction kterm(); while(cnts.size()) { while(cnts.size() s[cnt] )cnt; if(cnts.size())break; char ops[cnt]; if(op! op!-)break; cnt; Fraction rterm(); if(op)kr; else k-r; } return k; } void normal() { system(cls); cout普通\n; cin.ignore(numeric_limitsstreamsize::max(), \n); getline(cin,s); cnt0; Fraction ansexpr(); coutans; if(ans.den!1)cout ≈ ans.toDouble(); cout\n按下任意键继续……; string keyudong_niubi; cinkeyudong_niubi; system(cls); } void code(int a,int b) { coutnothing is here......; Sleep(500); return ; } void shuoming() { system(cls); cout目前支持 - * / % () [] {} ^支持小数和分数还能互相转换endl; cout作者keyudong,洛谷名keyudong,目前许多功能需↗要↘改↗进↘如有BUG和意见欢~迎~指~出~endl; cout转载请注明出处及作者; Sleep(3500); } void jihe() { while(1) { system(cls); cout什么形状endl; cout1长方体endl; cout2圆柱endl; cout3球体没做endl; cout4滚木endl; cout5退出endl; string c; cinc; if(c1) { double x,y,z; cout长:; cinx; coutendl宽:; ciny; coutendl高:; cinz; cout体积:x*y*zendl; cout表面积:2*(x*yx*zy*z)endl; string keyudong; cinkeyudong; } if(c2) { double r,h; coutr:; cinr; coutendlh:; cinh; cout体积:r*r*hπ ≈r*r*3.14*hendl;//////////////////////////////////////////////////////////////////////////////根据小数你自己改吧 cout表面积2*3.14*r*r3.14*r*h; string keyudong; cinkeyudong; } if(c3) { cout......;/////////////////////////////////////////////////////////////////////////////////////////////////////////////////待施工标记 } if(c4) { cout多少滚木; int gunmu; cingunmu; while(gunmu--)cout滚木滚木滚木endl; } if(c5)return ; Sleep(250); system(cls); } } int main() { while(1) { system(cls); cout-寄蒜气- 1.2endl; cout1普通endl; cout2程序员endl; cout3几何endl; cout4说明endl; string c; cinc; if(c1)normal(); //if(c2)//code(); if(c3)jihe(); if(c4)shuoming(); if(c114514)cout恭喜你发现了什么用也没有的彩↗蛋↘。; Sleep(250); system(cls); } return 0; }//使用愉快qwq
新的画大饼公告预加入几何功能已修bug平方变负数负数平方会崩小数取模卡死未修bug:暂时从来没人说呜呜稳定版功能少bug少#include bits/stdc.h #include windows.h using namespace std; // 分数有理数类 struct Fraction { long long num, den; Fraction(long long n0,long long d1):num(n),den(d) { if(den0) { num0; den1; return; } if(den0) { num-num; den-den; } long long ggcd(abs(num),den); num/g; den/g; } static long long gcd(long long a,long long b) { return b0?a:gcd(b,a%b); } double toDouble() const { return (double)num/den; } }; Fraction operator(const Fraction a,const Fraction b) { return Fraction(a.num*b.dena.den*b.num,a.den*b.den); } Fraction operator-(const Fraction a,const Fraction b) { return Fraction(a.num*b.den-a.den*b.num,a.den*b.den); } Fraction operator*(const Fraction a,const Fraction b) { return Fraction(a.num*b.num,a.den*b.den); } Fraction operator/(const Fraction a,const Fraction b) { return Fraction(a.num*b.den,a.den*b.num); } Fraction operator(Fraction a,const Fraction b) { aab; return a; } Fraction operator-(Fraction a,const Fraction b) { aa-b; return a; } Fraction operator*(Fraction a,const Fraction b) { aa*b; return a; } Fraction operator/(Fraction a,const Fraction b) { if(b.num0) { cout谁让你除以0的?; Sleep(1000); aFraction(0); return a; } aa/b; return a; } Fraction operator%(Fraction a,const Fraction b) { if(b.num0) { cout谁让你%0的?; Sleep(1000); aFraction(0); return a; } if(a.den!1||b.den!1) { cout取模仅支持整数!; Sleep(1000); aFraction(0); return a; } aFraction(a.num%b.num); return a; } bool operator(const Fraction a,const Fraction b) { return a.numb.numa.denb.den; } ostream operator(ostream out,const Fraction f) { if(f.den1) outf.num; else outf.num/f.den; return out; } string s; int pos; long long SToi(string s) { long long k0; for(int i0;is.size();i)k*10,ks[i]-0; return k; } string itos(int x) { if(x0)return 0; string s; while(x) { sx%100;x/10; } reverse(s.begin(),s.end()); return s; } Fraction expr(); Fraction term(); Fraction factor(); Fraction factor() { while(poss.size() s[pos] )pos; if(poss.size())return Fraction(0); Fraction val; if(s[pos](||s[pos][||s[pos]{) { char opens[pos]; char close(open(?):(open[?]:})); pos; valexpr(); if(poss.size()s[pos]close)pos; } else if(s[pos]||s[pos]-) { int f(s[pos]-)?-1:1; pos; return f*factor(); } else { string num; bool dotfalse; while(poss.size()(isdigit(s[pos])||(s[pos].!dot))) { if(s[pos].)dottrue; nums[pos]; } if(!dot) { valFraction(SToi(num)); } else { long long a0,b0,den1; int i0; while(inum.size()num[i]!.) { aa*10num[i]-0; i; } i; while(inum.size()) { bb*10num[i]-0; den*10; i; } valFraction(a*denb,den); } } while(poss.size()) { while(poss.size() s[pos] )pos; if(poss.size()||s[pos]!^)break; pos; Fraction expfactor(); if(exp.den!1) { cout指数必须为整数!; Sleep(1000); return Fraction(0); } long long eexp.num; if(val.num0 e0) { cout0不能有负指数!; Sleep(1000); return Fraction(0); } bool nege0; unsigned long long nneg?-static_castunsigned long long(e):static_castunsigned long long(e); Fraction res(1); Fraction baseval; while(n) { if(n1)resres*base; basebase*base; n1; } if(neg)resFraction(1)/res; valres; } return val; } Fraction term() { Fraction leftfactor(); while(poss.size()) { while(poss.size() s[pos] )pos; if(poss.size())break; char ops[pos]; if(op!* op!/ op!%)break; pos; Fraction rightfactor(); if(op*)left*right; else if(op/) { if(right.num0) { cout谁让你除以0的?; Sleep(1000); return Fraction(0); } left/right; } else { if(right.num0) { cout谁让你%0的?; Sleep(1000); return Fraction(0); } left%right; } } return left; } Fraction expr() { Fraction leftterm(); while(poss.size()) { while(poss.size() s[pos] )pos; if(poss.size())break; char ops[pos]; if(op! op!-)break; pos; Fraction rightterm(); if(op)leftright; else left-right; } return left; } void normal() { system(cls); cout普通\n; cin.ignore(numeric_limitsstreamsize::max(), \n); getline(cin,s); pos0; Fraction ansexpr(); coutans; if(ans.den!1)cout ≈ ans.toDouble(); cout\n按下任意键继续……; string keyudong_niubi; cinkeyudong_niubi; system(cls); } void code(int a,int b) { //施工中……………… } void shuoming() { system(cls); cout目前支持 - * / % () [] {} ^支持小数和分数还能互相转换endl; cout作者keyudong,洛谷名keyudong,目前许多功能需↗要↘改↗进↘如有BUG和意见欢~迎~指~出~endl; cout转载请注明出处及作者点个赞把QWQ; Sleep(3500); } int main() { while(1) { system(cls); cout-寄蒜气- 1.2endl; cout1普通endl; cout2程序员endl; cout3说明endl; string c; cinc; if(c1)normal(); //if(c2)//code(); if(c3)shuoming(); if(c4)cout恭喜你发现了什么用也没有的彩↗蛋↘。; Sleep(250); system(cls); } return 0; }//使用愉快qwq最新功能多bug可能多#include bits/stdc.h #include windows.h using namespace std; // 分数有理数类 struct Fraction { long long num, den; Fraction(long long n0,long long d1):num(n),den(d) { if(den0) { num0; den1; return; } if(den0) { num-num; den-den; } long long ggcd(abs(num),den); num/g; den/g; } static long long gcd(long long a,long long b) { return b0?a:gcd(b,a%b); } double toDouble() const { return (double)num/den; } }; Fraction operator(const Fraction a,const Fraction b) { return Fraction(a.num*b.dena.den*b.num,a.den*b.den); } Fraction operator-(const Fraction a,const Fraction b) { return Fraction(a.num*b.den-a.den*b.num,a.den*b.den); } Fraction operator*(const Fraction a,const Fraction b) { return Fraction(a.num*b.num,a.den*b.den); } Fraction operator/(const Fraction a,const Fraction b) { return Fraction(a.num*b.den,a.den*b.num); } Fraction operator(Fraction a,const Fraction b) { aab; return a; } Fraction operator-(Fraction a,const Fraction b) { aa-b; return a; } Fraction operator*(Fraction a,const Fraction b) { aa*b; return a; } Fraction operator/(Fraction a,const Fraction b) { if(b.num0) { cout谁让你除以0的?; Sleep(1000); aFraction(0); return a; } aa/b; return a; } Fraction operator%(Fraction a,const Fraction b) { if(b.num0) { cout谁让你%0的?; Sleep(1000); aFraction(0); return a; } if(a.den!1||b.den!1) { cout取模仅支持整数!; Sleep(1000); aFraction(0); return a; } aFraction(a.num%b.num); return a; } bool operator(const Fraction a,const Fraction b) { return a.numb.numa.denb.den; } ostream operator(ostream out,const Fraction f) { if(f.den1) outf.num; else outf.num/f.den; return out; } string s; int cnt; long long SToi(string s) { long long k0; for(int i0;is.size();i)k*10,ks[i]-0; return k; } string itos(int x) { if(x0)return 0; string s; while(x) { sx%100;x/10; } reverse(s.begin(),s.end()); return s; } Fraction expr(); Fraction term(); Fraction factor(); Fraction factor() { while(cnts.size() s[cnt] )cnt; if(cnts.size())return Fraction(0); Fraction v; if(s[cnt](||s[cnt][||s[cnt]{) { char opens[cnt]; char close(open(?):(open[?]:})); cnt; vexpr(); if(cnts.size()s[cnt]close)cnt; } else if(s[cnt]||s[cnt]-) { int f(s[cnt]-)?-1:1; cnt; return f*factor(); } else { string num; bool dotfalse; while(cnts.size()(isdigit(s[cnt])||(s[cnt].!dot))) { if(s[cnt].)dottrue; nums[cnt]; } if(!dot) { vFraction(SToi(num)); } else { long long a0,b0,den1; int i0; while(inum.size()num[i]!.) { aa*10num[i]-0; i; } i; while(inum.size()) { bb*10num[i]-0; den*10; i; } vFraction(a*denb,den); } } while(cnts.size()) { while(cnts.size() s[cnt] )cnt; if(cnts.size()||s[cnt]!^)break; cnt; Fraction expfactor(); if(exp.den!1) { cout指数得是整数!; Sleep(1000); return Fraction(0); } long long eexp.num; if(v.num0 e0) { cout0 不能have负指数!; Sleep(1000); return Fraction(0); } bool nege0; unsigned long long nneg?-static_castunsigned long long(e):static_castunsigned long long(e); Fraction ac(1); Fraction basev; while(n) { if(n1)acac*base; basebase*base; n1; } if(neg)acFraction(1)/ac; vac; } return v; } Fraction term() { Fraction kfactor(); while(cnts.size()) { while(cnts.size() s[cnt] )cnt; if(cnts.size())break; char ops[cnt]; if(op!* op!/ op!%)break; cnt; Fraction rfactor(); if(op*)k*r; else if(op/) { if(r.num0) { cout谁让你除以0的?; Sleep(1000); return Fraction(0); } k/r; } else { if(r.num0) { cout谁让你%0的?; Sleep(1000); return Fraction(0); } k%r; } } return k; } Fraction expr() { Fraction kterm(); while(cnts.size()) { while(cnts.size() s[cnt] )cnt; if(cnts.size())break; char ops[cnt]; if(op! op!-)break; cnt; Fraction rterm(); if(op)kr; else k-r; } return k; } void normal() { system(cls); cout普通\n; cin.ignore(numeric_limitsstreamsize::max(), \n); getline(cin,s); cnt0; Fraction ansexpr(); coutans; if(ans.den!1)cout ≈ ans.toDouble(); cout\n按下任意键继续……; string keyudong_niubi; cinkeyudong_niubi; system(cls); } void code(int a,int b) { coutnothing is here......; Sleep(500); return ; } void shuoming() { system(cls); cout目前支持 - * / % () [] {} ^支持小数和分数还能互相转换endl; cout作者keyudong,洛谷名keyudong,目前许多功能需↗要↘改↗进↘如有BUG和意见欢~迎~指~出~endl; cout转载请注明出处及作者; Sleep(3500); } void jihe() { while(1) { system(cls); cout什么形状endl; cout1长方体endl; cout2圆柱endl; cout3球体没做endl; cout4滚木endl; cout5退出endl; string c; cinc; if(c1) { double x,y,z; cout长:; cinx; coutendl宽:; ciny; coutendl高:; cinz; cout体积:x*y*zendl; cout表面积:2*(x*yx*zy*z)endl; string keyudong; cinkeyudong; } if(c2) { double r,h; coutr:; cinr; coutendlh:; cinh; cout体积:r*r*hπ ≈r*r*3.14*hendl;//////////////////////////////////////////////////////////////////////////////根据小数你自己改吧 cout表面积2*3.14*r*r3.14*r*h; string keyudong; cinkeyudong; } if(c3) { cout......;/////////////////////////////////////////////////////////////////////////////////////////////////////////////////待施工标记 } if(c4) { cout多少滚木; int gunmu; cingunmu; while(gunmu--)cout滚木滚木滚木endl; } if(c5)return ; Sleep(250); system(cls); } } int main() { while(1) { system(cls); cout-寄蒜气- 1.2endl; cout1普通endl; cout2程序员endl; cout3几何endl; cout4说明endl; string c; cinc; if(c1)normal(); //if(c2)//code(); if(c3)jihe(); if(c4)shuoming(); if(c114514)cout恭喜你发现了什么用也没有的彩↗蛋↘。; Sleep(250); system(cls); } return 0; }//使用愉快qwq
