어느 부분이 속도를 잡아먹나요?

#include <iostream> #include <vector> using namespace std; class bigint { private: char sign; //+:0, -:1 vector<char> arr; public: bigint(); bigint(bigint &); bigint(char *); bigint(int); bigint operator=(char *); bigint operator=(int); friend bigint operator+(bigint &, bigint &); friend bigint operator*(bigint &, bigint &); void print(); }; bigint::bigint() { sign=0; arr.insert(arr.begin(),0); } bigint::bigint(bigint &src) { this->sign = src.sign; this->arr = src.arr; } bigint::bigint(int src) { *this=src; } bigint::bigint(char *src) { *this=src; } bigint bigint::operator=(char *src) { this->arr.resize(0); while(*src != '\0') { this->arr.push_back( *src - '0'); src++; } return *this; } bigint bigint::operator=(int src) { char str[15]; sprintf(str,"%d",src); *this=str; return *this; } bigint operator+(bigint &first, bigint &second) { bigint toreturn, t_f, t_s; vector<char>::iterator p_f, p_s; int hi; t_f=first; t_s=second; toreturn.arr.resize(0); //빈칸채움 if(first.arr.size() > second.arr.size()) t_s.arr.insert(t_s.arr.begin(),first.arr.size()-second.arr.size(),0); else t_f.arr.insert(t_f.arr.begin(),second.arr.size()-first.arr.size(),0); p_f=t_f.arr.end()-1; p_s=t_s.arr.end()-1; hi=0; while(1) { hi=*p_f + *p_s +hi; toreturn.arr.insert(toreturn.arr.begin(), hi%10); hi/=10; //-=10; if(p_f == t_f.arr.begin()) break; p_f--; p_s--; } if(hi) toreturn.arr.insert(toreturn.arr.begin(),hi); return toreturn; } bigint operator*(bigint &first, bigint &second) { bigint toreturn, toadd; vector<char>::iterator p_f, p_s; int hi,shift; p_s=second.arr.end()-1; shift=0; while(1) { p_f=first.arr.end()-1; toadd.arr.resize(0); hi=0; while(1) { hi=*p_f * *p_s + hi; toadd.arr.insert(toadd.arr.begin(), hi%10); hi/=10; if(p_f==first.arr.begin()) break; p_f--; } if(hi) toadd.arr.insert(toadd.arr.begin(), hi); toadd.arr.insert(toadd.arr.end(),shift++,0); toreturn=toreturn+toadd; if(p_s==second.arr.begin()) break; p_s--; } return toreturn; } void bigint::print() { if(sign==0) cout<<'+'; else cout<<'-'; for(vector<char>::iterator p = arr.begin(); p<arr.end(); p++) { cout<<(int)*p; } cout<<endl; } void fac(int a) { bigint fn=1; int cnt=1; for(; cnt<=a; cnt++) { fn=fn*(bigint)cnt; } fn.print(); } int main() { int n; scanf("%d", &n); while(n) { fac(n); scanf("%d", &n); } return 0; }

vector의 어느 함수가... ㅡ.,ㅡ;;;;

이 분은 지금 영창에 계실테고 전 내일 학교에. 흑