#ifdef __GNUC__ #pragma GCC optimize ("O3") #pragma GCC target ("avx") #endif #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)< #define MAIN_INIT std::cin.tie(0); \ std::ios::sync_with_stdio(false);\ std::cout << std::fixed;//小数を10進数表示 ///////// #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);} //////////////////////////////// inline void solve(){ string str; reader(str); int size = str.size(); vector L(size,0); vector R(size,0); if( str[0] == '(' ){ L[0] = 1; } for(int i=1;i=0;--i){ R[i] = (str[i] == ')') + R[i+1]; } ///// int pos; int Lkao = 0;//(^^*)左向き for(int i=size-1;i>=0;--i){ if( str[i] == ')' ){ pos = i-1; for(;pos>=0 && str[pos] != '*' ;--pos){}--pos; for(;pos>=0 && str[pos] != '^' ;--pos){}--pos; for(;pos>=0 && str[pos] != '^' ;--pos){}--pos; if( pos >= 0 ){ Lkao += L[pos]; } } } ///// int Rkao = 0;//(*^^)右向き for(int i=0;i