[namespace hdk] StringAddition_InFix

合集 - C++模版(16)

1.[C++] 不新不好的前向星类2024-02-082.[C++] 不新不好的高精类2024-02-083.[C++] 不新不好的矩阵运算类2024-02-084.[C++] 关于矩阵运算类的历史残次品记录2024-02-085.[C++] 基于字符串的高精度容器 3.02024-02-156.[C++] 封装树状数组2024-02-187.[C++] 封装了个...滑动窗口2024-02-218.[C++] 对拍模板2024-02-229.[C++] Rander2024-05-22

10.[namespace hdk] StringAddition_InFix2024-06-10

11.[namespace hdk] ordered_vector2024-07-0412.[namespace hdk] Balanced_tree 整合2024-07-0913.[namespace hdk] 向量 direct_vector2024-07-1314.[namespace hdk] 64位 bitset2024-07-2215.[namespace hdk] diff.h2024-07-2516.[namespace hdk] modint2024-09-13

收起

namespace hdk{
	const size_t fixsize=10000;
	class StringAddition_InFix{
		private:
			string x="00";
			inline void fixed(int size){
				if(size<=x.length())return;
				string res;
				for(int i=1;i<=size-x.length();++i){
					res.push_back('0');
				}
				for(int i=0;i<=x.length()-1;++i){
					res.push_back(x[i]);
				}
				x=res;
			}
			inline void refixed(){
				string res;bool is0=false;
				res.push_back('0');
				for(int i=0;i<=x.length()-1;++i){
					if(x[i]!='0'||is0){
						is0=true;
						res.push_back(x[i]);
					}
				}
				x=res;
			}
		public:
			void operator =(string inx){
				x.push_back('0');
				for(int i=0;i<=inx.length()-1;++i){
					x.push_back(inx[i]);
				}
			}
			void operator =(long long inx){
				x.clear();string ans;
				int r=inx;
				while(r){
					ans.push_back(r%10+'0');
					r/=10;
				}
				x.push_back('0');
				for(int i=ans.size()-1;i>=0;--i){
					x.push_back(ans[i]);
				}
			}
			string it(){
				string res;
				for(int i=1;i<=x.length()-1;++i){
					res.push_back(x[i]);
				}
				if(res.empty()) res="0";
				return res;
			}
			StringAddition_InFix operator +(StringAddition_InFix a){
				StringAddition_InFix ans;ans=a;
				if(x.length()>ans.x.length()){
					ans.fixed(x.length());
				}
				else fixed(ans.x.length());
				for(int i=max(x.length(),ans.x.length())-1;i>=1;--i){
					int np=(ans.x[i]-'0'+x[i]-'0');
					if(np>=10) ans.x[i-1]+=np/10;
					ans.x[i]=np%10+'0';
				}
				ans.refixed();refixed();
				return ans;
			}
			StringAddition_InFix operator +(long long a){
				StringAddition_InFix r;r=a;
				return *this+r;
			}
			void operator +=(StringAddition_InFix a){
				*this=*this+a;
			}
			void operator +=(long long a){
				*this=*this+a;
			}
			friend ostream& operator<<(ostream& output,StringAddition_InFix& inx){
				output<<inx.it()<<endl;
				return output;
			}
			friend istream& operator>>(istream& input,StringAddition_InFix& inx){
			   input>>inx.x;
			   inx.fixed(inx.x.length()+1);
			   return input;
			}
	};
	typedef StringAddition_InFix Int;
	Int max(Int &la,Int &lb){
		if(la.it()>lb.it()) return la;
		else return lb;
	}
	Int min(Int &la,Int &lb){
		if(la.it()<lb.it()) return lb;
		else return la;
	}
}