#define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include//assert(); #include ///////// #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) #define P(p) cout<<(p)< ///////// #ifdef getchar_unlocked #define mygc(c) (c)=getchar_unlocked() #else #define mygc(c) (c)=getchar() #endif #ifdef putchar_unlocked #define mypc(c) putchar_unlocked(c) #else #define mypc(c) putchar(c) #endif ///////// typedef long long LL; typedef long double LD; typedef unsigned long long ULL; ///////// using namespace::std; ///////// #ifdef _DEBUG #define DEBUG_BOOL(b) assert(b) #else #define DEBUG_BOOL(b) #endif /////数値読み込み #define ENABLE_READER_ON(T) \ inline void reader(T &x){int k;x = 0;bool flag = true;\ while(true){mygc(k);\ if( k == '-'){flag = false;break;}if('0' <= k && k <= '9'){x = k - '0';break;}\ }\ if( flag ){while(true){mygc(k);if( k<'0' || '9' inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);} // 最小公倍数 template inline T lcm(T a, T b){return a * b / gcd(a, b);} //////////////////////////////// //pear typedef pair Pnum; const ULL MAX=10000000000000000000; //10**19 Pnum mul(ULL num1,ULL num2){ Pnum ret; const ULL MH = 10000000000;//10**10 const ULL ML = 1000000000;//10**9 ULL CARR; ULL CAL,TEMP1,TEMP2; ULL AH,AL; ULL BH,BL; AH = num1/ML; AL = num1%ML; BH = num2/ML; BL = num2%ML; ret.second = AL*BL;//10**18 CAL = AH*BL+AL*BH;//10**18 ret.first = CAL/MH; TEMP1 = MAX - ret.second - 1; TEMP2 = (CAL%MH)*ML; CARR = 0; if( TEMP1 >= TEMP2 ){ ret.second += TEMP2; }else{ TEMP2 = TEMP2 - TEMP1 - 1; CARR = 1; ret.second = TEMP2; } ////// CAL = AH*BH ; ret.first += CAL/10; TEMP1 = MAX - ret.second -1; TEMP2 = (CAL%10) * (MAX/10); CARR = 0; if( TEMP1 >= TEMP2 ){ ret.second += TEMP2; }else{ TEMP2 = TEMP2 - TEMP1 - 1; CARR = 1; ret.second = TEMP2; } ret.first += CARR; return ret; } Pnum add(Pnum A,Pnum B){ ULL TEMP1,TEMP2,CARR; Pnum ret; ret = A; TEMP1 = MAX - A.second - 1; TEMP2 = B.second; if( TEMP1 >= TEMP2 ){ ret.second += TEMP2; }else{ TEMP2 = TEMP2 - TEMP1 - 1; CARR = 1; ret.second = TEMP2; } ret.first += CARR + B.first;//over return ret; } void show(Pnum num){ bool flag = false; if( num.first != 0){ cout << num.first; flag = true; } if( flag ){ ULL tempMax = MAX; while(tempMax != 0 && num.second / tempMax == 0){ cout << "0"; tempMax /= 10; } } if( num.second ){ cout << num.second; } } bool operator>(Pnum A,Pnum B){ if( A.first > B.first )return true; if( A.first < B.first )return false; if( A.second > B.second )return true; if( A.second < B.second )return false; return false; } bool operator<(Pnum A,Pnum B){ return B>A; } bool operator==(Pnum A,Pnum B){ if(A.first == B.first && A.second == B.second){ return true; } return false; } bool operator>=(Pnum A,Pnum B){ return A>B || A==B; } bool operator<=(Pnum A,Pnum B){ return AB); Pnum ret; ret = A; if( ret.first >= B.first ){ ret.first -= B.first; } if( ret.second < B.second ){ assert(ret.first >= 1); ret.first -=1; ret.second += MAX - B.second; }else{ ret.second -= B.second; } return ret; } ULL operator%(Pnum A,ULL C){ Pnum pnum1,pnum2; pnum1 = A; ULL tempMAX = MAX; while(tempMAX ){ pnum2 = mul(C,tempMAX); while( pnum1 > pnum2 ){ pnum1 = pnum1 - pnum2; } tempMAX /= 10; } return pnum1.second; } inline void solve(){ ULL A,B,C; reader(A); reader(B); C = A+B; //A = 876543210987654321; //B = 876543210987654321; //A = 1000000000000000000; //B = 1000000000000000000; //1000000000000000000 //cout << A << "\n" << B << endl; Pnum AB; AB = mul(A,B); //show(AB); //cout << endl; //AB%C ULL D = AB % C; //cout << D << endl; cout << gcd(C,D) << endl; } int main(void){ std::cin.tie(0); std::ios::sync_with_stdio(false); std::cout << std::fixed;//小数を10進数表示 cout << setprecision(16);//小数をいっぱい表示する。16? solve(); return 0; }