#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 #include //assert(); #include ///////// #define REP(i, x, n) for(int i = x; i < n; i++) #define rep(i,n) REP(i,0,n) ///////// typedef long long LL; typedef long double LD; typedef unsigned long long ULL; #define PII pair ///////// using namespace::std; // 最大公約数 template 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(){ const int Fam = 3; vector hist(101,0); int temp; for(int i=0;i> temp; hist[temp]++; } vector needSize; vector needNum; for(int i=1;i<=100;++i){ if( hist[i] ){ needSize.push_back(i); needNum.push_back(hist[i]); } } int Anum; cin >> Anum;; vector Range(Fam+1,0); int size = needSize.size(); bool flag; for(int i=0;i> temp; flag = false; for(int j=0;j= needSize[size-j-1] ){ flag = true; Range[Fam-j]++; break; } } if( flag == false ){ Range[0]++; } } int N = Anum; int D = Range[Fam]; int ans = (1< 0 ){ ans -= (1< 0){ ans -= (1<<(Range[0]+Range[1]) ) * D; } //A:* B:0 C:0 D:1 if( Range[1] == 0 && Range[2] == 0 ){ ans -= (1<