key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector iota(const size_type n) {\\n std::vector I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\ntemplate < class T > vector< T >& operator++(vector< T >& a) { for(T& x : a) x++; return a; }\\ntemplate < class T > vector< T >& operator--(vector< T >& a) { for(T& x : a) x--; return a; }\\ntemplate < class T > vector< T > operator++(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x++; return res; }\\ntemplate < class T > vector< T > operator--(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x--; return res; }\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"main.cpp\\\"\\n\\ni64 solve(int N, int M) {\\n vector A(N, 0), B(N, 0), C(N, 0);\\n for(int i : rep(M - 1)) {\\n i64 a = in(), x = in(); x--;\\n i64 d = floor(sqrtl(a));\\n if(x + 1 < N) A[x + 1] += 1;\\n if(x + 2 < N) A[x + 2] += 1;\\n if(x + d + 1 < N) A[x + d + 1] -= (d + 1) * (d + 1);\\n if(x + d + 2 < N) A[x + d + 2] += (d + 1) * (d + 1) + d * d - 2;\\n if(x + d + 3 < N) A[x + d + 3] -= d * d;\\n\\n if(0 <= x - 1) B[x - 1] += 1;\\n if(0 <= x - 2) B[x - 2] += 1;\\n if(0 <= x - d - 1) B[x - d - 1] -= (d + 1) * (d + 1);\\n if(0 <= x - d - 2) B[x - d - 2] += (d + 1) * (d + 1) + d * d - 2;\\n if(0 <= x - d - 3) B[x - d - 3] -= d * d;\\n\\n C[max(x - d, 0LL)] += a;\\n if(x + d + 1 < N) C[x + d + 1] -= a;\\n }\\n\\n for(int _ : rep(3)) for(int i : rep(N - 1)) A[i + 1] += A[i];\\n for(int _ : rep(3)) for(int i : revrep(N - 1)) B[i] += B[i + 1];\\n for(int _ : rep(1)) for(int i : rep(N - 1)) C[i + 1] += C[i];\\n vector D(N);\\n for(int i : rep(N)) D[i] = C[i] - A[i] - B[i];\\n\\n i64 E = in();\\n\\n i64 ok = 0, ng = 1e18;\\n while(ng - ok > 1) {\\n i64 X = (ok + ng) / 2;\\n\\n bool check = [&] {\\n i64 L = 0, R = N - 1;\\n for(int i : rep(N)) if(D[i] < X) {\\n if(D[i] + E < X) return false;\\n i64 p = floor(sqrtl(D[i] + E - X));\\n chmax(L, i64(i) - p);\\n chmin(R, i64(i) + p);\\n }\\n return L <= R;\\n }();\\n\\n (check ? ok : ng) = X;\\n }\\n return ok;\\n}\\n\\nint main() {\\n while(true) {\\n int N = in(), M = in();\\n if(make_pair(N, M) == make_pair(0, 0)) return 0;\\n print(solve(N, M));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 34528,\n \"score_of_the_acc\": -0.2106,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_2886_9092361\",\n \"code_snippet\": \"#include\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\nll INF = 1e18;\\nbool is_end = false;\\n\\nbool isOK(ll mid, const vector &defense, ll a)\\n{\\n ll N = defense.size();\\n vector diff(N, 0);\\n for (int i = 0; i < N; ++i)\\n {\\n diff[i] = max(0LL, mid - defense[i]);\\n }\\n \\n vector L(N), R(N);\\n for (int i = 0; i < N; ++i)\\n {\\n ll d = diff[i];\\n if (d > a) return false;\\n \\n if (d == 0)\\n {\\n L[i] = -INF;\\n R[i] = INF;\\n }\\n else\\n {\\n ll w = sqrt((ld)(a - d));\\n L[i] = max(0LL, i - w);\\n R[i] = min(N-1, i + w);\\n }\\n }\\n \\n ll maxL = *max_element(L.begin(), L.end());\\n ll minR = *min_element(R.begin(), R.end());\\n \\n return maxL <= minR;\\n}\\n\\nvoid solve()\\n{\\n ll N, M; cin >> N >> M;\\n \\n if (N == 0 && M == 0)\\n {\\n is_end = true;\\n return;\\n }\\n \\n vector A(M), X(M);\\n for (int i = 0; i < M-1; ++i)\\n {\\n ll a, x; cin >> a >> x;\\n x -= 1;\\n A[i] = a, X[i] = x;\\n }\\n {\\n int i = M-1;\\n ll a; cin >> a;\\n A[i] = a, X[i] = -1;\\n }\\n \\n vector defense(N, 0);\\n vector< pair> > vec;\\n for (int i = 0; i < M-1; ++i)\\n {\\n ll a = A[i], x = X[i];\\n ll w = sqrt((ld)a);\\n ll left = max(0LL, x - w), right = min(N, x + w + 1);\\n \\n assert(w * w <= a && a < (w + 1) * (w + 1));\\n \\n vec.push_back({ left, {a - x * x, 2 * x, -1} });\\n vec.push_back({ right, {- a + x * x, -2 * x, 1} });\\n // cout << left << \\\" \\\" << right << endl;\\n }\\n sort(vec.begin(), vec.end());\\n \\n {\\n ll a = 0, b = 0, c = 0;\\n ll id = 0;\\n for (int i = 0; i < N; ++i)\\n {\\n while (id < (ll)vec.size())\\n {\\n auto [pos, tup] = vec[id];\\n if (i < pos) break;\\n \\n auto [na, nb, nc] = tup;\\n a += na, b += nb, c += nc;\\n \\n id++;\\n }\\n \\n defense[i] = (a + b * i + c * i * i);\\n }\\n }\\n \\n // for (int i = 0; i < N; ++i)\\n // {\\n // cout << defense[i] << \\\" \\\";\\n // }\\n // cout << endl;\\n \\n ll ok = *min_element(defense.begin(), defense.end());\\n ll ng = 1e18;\\n \\n // cout << ok << \\\" \\\" << ng << endl;\\n \\n while (abs(ok - ng) > 1)\\n {\\n ll mid = (ok + ng) / 2;\\n \\n if (isOK(mid, defense, A[M-1])) ok = mid;\\n else ng = mid;\\n }\\n cout << ok << endl;\\n \\n \\n return;\\n}\\n\\nint main()\\n{\\n while (!is_end)\\n {\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1310,\n \"memory_kb\": 43396,\n \"score_of_the_acc\": -0.6771,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_2886_8013467\",\n \"code_snippet\": \"#include\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i,s,t) for (int i = (int)(s); i < (int)(t); ++i)\\n#define all(x) (x).begin(), (x).end()\\n\\nint main(){\\n while(true){\\n int N,M;\\n cin>>N>>M;\\n if(N==0)break;\\n vector val(N);\\n rep(i,0,M-1){\\n ll a;\\n int x;\\n cin>>a>>x;\\n --x;\\n val[x]+=a;\\n for(ll y=1;a-y*y>0&&(x-y>=0 || x+y=0)val[x-y] += a-y*y;\\n if (x+y>a;\\n ll lb = *min_element(all(val)), ub = 1e15;\\n while(ub-lb>1){\\n ll m = (lb+ub)/2;\\n\\n bool ok = true;\\n int minright = N, maxleft = -1;\\n rep(i,0,N){\\n if(val[i]>=m)continue;\\n if (val[i]+a-m<0){\\n ok=false;\\n break;\\n }\\n ll s = sqrt(val[i]+a-m);\\n while((s+1)*(s+1)<=val[i]+a-m)++s;\\n maxleft=max(maxleft,i-(int)s);\\n minright=min(minright,i+(int)s);\\n if(minright\n#define rep(i,n) for(int i=0;i<(n);i++)\nusing namespace std;\n#define all(a) a.begin(),a.end()\n#define compress(a) sort(all(a));a.erase(unique(all(a)),a.end())\ntypedef long long ll;\ntypedef pair P;\nconstexpr ll mod=998244353;\nconstexpr ll inf=3e18;\n// #define double long double\n\ntypedef vector> mat;\n\nmat mul(mat &A,mat &B){\n int n=A.size();\n mat C(n,vector(n));\n\n rep(i,n){\n rep(j,n){\n rep(k,n){\n C[i][j]+=A[i][k]*B[k][j];\n }\n }\n }\n return C;\n}\nmat pow(mat A,ll n){\n int m=A.size();\n mat res(m,vector(m));\n rep(i,m)res[i][i]=1;\n while(n){\n if(n&1)res=mul(res,A);\n A=mul(A,A);\n n>>=1;\n }\n return res;\n}\n\nint solve(){\n ll n,m;\n cin>>n>>m;\n if(!n)return 0;\n vectorprob(130);\n prob[0]=1;\n rep(i,n){\n for(int j=6*i+6;j>=i;j--){\n double res=0;\n for(int k=1;k<=6;k++){\n if(j-k>=0)res+=prob[j-k]/6;\n }\n prob[j]=res;\n }\n }\n\n int ez=7*n/2;\n double E=(double)(n)*3.5;\n ll turn=1;\n\n while(1){\n double p=0,r=0;\n for(int i=0;i<=ez;i++)p+=prob[i];\n for(int i=ez+1;i<=6*n;i++)r+=prob[i]*i;\n \n //ezを超える瞬間を求める\n mat M(2,vector(2));\n M[0][0]=p;\n M[0][1]=r;\n M[1][1]=1;\n\n ll lb=0,ub=m;\n while(ub-lb>1){\n ll mi=(ub+lb)/2;\n mat M2=pow(M,mi);\n double ek=E*M2[0][0]+M2[0][1];\n if(ek=m){\n mat M3=pow(M,m-turn);\n cout<\nusing namespace std;\n\n#include \nusing namespace atcoder;\n\nusing ll = long long;\nusing mint = modint998244353;\n\nbool solve() {\n using ld = __float128;\n using ld2 = long double;\n ll N, M;\n cin >> N >> M;\n if(N == 0) return false;\n vector dp(N + 1, vector(6 * N + 1));\n dp[0][0] = 1;\n for(int i = 1; i <= N; i++) {\n for(int j = 1; j <= 6 * i; j++) {\n for(int k = 1; k <= 6 && j - k >= 0; k++) {\n dp[i][j] += dp[i - 1][j - k];\n }\n }\n // for(int j = 1; j <= 6 * i; j++) {\n // cout << dp[i][j] << \" \\n\"[j == 6 * i];\n // }\n }\n const ld C = accumulate(dp[N].begin(), dp[N].end(), 0LL);\n vector P(6 * N + 1);\n for(int j = 0; j <= 6 * N; j++) {\n P[j] = dp[N][j] / C;\n // cout << fixed << setprecision(20) << P[j] * j << endl;\n }\n auto f = [&](ld a, ld b, ld x, ll k) -> ld {\n array X = {1, 0, 0, 1};\n array Y = {a, b, 0, 1};\n array Z = {0, 0, 0, 0};\n // cout << \"# \" << (ld2)a << \" \" << (ld2)b << \" \" << k << endl;\n while(k) {\n if(k & 1) {\n Z[0] = X[0] * Y[0] + X[1] * Y[2];\n Z[1] = X[0] * Y[1] + X[1] * Y[3];\n Z[2] = X[2] * Y[0] + X[3] * Y[2];\n Z[3] = X[2] * Y[1] + X[3] * Y[3];\n swap(X, Z);\n }\n {\n Z[0] = Y[0] * Y[0] + Y[1] * Y[2];\n Z[1] = Y[0] * Y[1] + Y[1] * Y[3];\n Z[2] = Y[2] * Y[0] + Y[3] * Y[2];\n Z[3] = Y[2] * Y[1] + Y[3] * Y[3];\n swap(Y, Z);\n }\n k >>= 1;\n }\n // cout << (ld2)X[0] << \" \" << (ld2)X[1] << endl;\n return X[0] * x + X[1];\n };\n if(M < 1e6) {\n vector ep(M + 1);\n for(int i = 1; i <= M; i++) {\n for(int j = 0; j <= 6 * N; j++) {\n ep[i] += P[j] * max((ld)j, ep[i - 1]);\n }\n }\n cout << fixed << setprecision(5) << (ld2)ep[M] << endl;\n return true;\n }\n M--;\n ld x = 3.5 * N;\n for(int i = floor(3.5 * N); M > 0 && i <= 6 * N; i++) {\n // cout << M << endl;\n ld a = 0, b = 0;\n for(int j = 0; j <= i; j++) a += P[j];\n for(int j = i + 1; j <= 6 * N; j++) b += P[j] * j;\n if(f(a, b, x, M) < i + 1) {\n x = f(a, b, x, M);\n break;\n }else {\n ll ok = 0, ng = M;\n while(ok + 1 < ng) {\n ll k = (ok + ng) / 2;\n if(f(a, b, i, k) < i + 1) ok = k;\n else ng = k;\n }\n x = f(a, b, x, ng);\n M -= ng;\n }\n }\n cout << fixed << setprecision(5) << (ld2)x << endl;\n return true;\n}\n\nint main() {\n while(solve());\n}","accuracy":1,"time_ms":110,"memory_kb":3968,"score_of_the_acc":-0.0675,"final_rank":15},{"submission_id":"aoj_2887_10562818","code_snippet":"#include\nusing namespace std;\nusing ll=long long;\n#define all(v) v.begin(),v.end()\n#define rall(v) v.rbegin(),v.rend()\ntemplate bool chmax(T &a, T b){if (a < b){a = b;return true;} else return false;}\ntemplate bool chmin(T &a, T b){if (a > b){a = b;return true;} else return false;}\n\ntemplate \nstruct Matrix {\n vector> A;\n Matrix(int n, int m) : A(n, vector(m, 0)) {}\n Matrix(int n) : A(n, vector(n, 0)) {}\n int height() const {\n return (A.size());\n }\n int width() const {\n return (A[0].size());\n }\n const vector &operator[](int k) const {\n return (A[k]);\n }\n vector &operator[](int k) {\n return (A[k]);\n }\n static Matrix I(int n) {\n Matrix mat(n);\n for (int i = 0; i < n; i++) mat[i][i] = 1;\n return mat;\n }\n Matrix &operator+=(const Matrix &B) {\n int n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n (*this)[i][j] += B[i][j];\n }\n }\n return (*this);\n }\n Matrix &operator-=(const Matrix &B) {\n int n = height(), m = width();\n assert(n == B.height() && m == B.width());\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n (*this)[i][j] -= B[i][j];\n }\n }\n return (*this);\n }\n Matrix &operator*=(const Matrix &B) {\n int n = height(), m = B.width(), p = width();\n assert(p == B.height());\n vector> C(n, vector(m, 0));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n for (int k = 0; k < p; k++) {\n C[i][j] += (*this)[i][k] * B[k][j];\n }\n }\n }\n A.swap(C);\n return (*this);\n }\n Matrix &operator^=(long long k) {\n int n = height();\n assert(n == width());\n Matrix B = Matrix::I(n);\n while (k > 0) {\n if (k & 1) B *= *this;\n *this *= *this;\n k >>= 1LL;\n }\n A.swap(B.A);\n return (*this);\n }\n Matrix operator+(const Matrix &B) const {\n return (Matrix(*this) += B);\n }\n Matrix operator-(const Matrix &B) const {\n return (Matrix(*this) -= B);\n }\n Matrix operator*(const Matrix &B) const {\n return (Matrix(*this) *= B);\n }\n Matrix operator^(const long long k) const {\n return (Matrix(*this) ^= k);\n }\n};\n\nusing ld=long double;\nconst ld EPS=1e-12;\n\nvoid Solve(int N,ll M){\n vector cp(N+1,vector(6*N+1));\n cp[0][0]=1;\n for(int i=0;ip(6*N+1),e(6*N+1);\n for(int i=0;i<=6*N;i++){\n for(int j=0;j<=i;j++){\n p[i]+=cp[N][j];\n }\n for(int j=i+1;j<=6*N;j++){\n e[i]+=j*cp[N][j];\n }\n }\n mapans;\n ans[0]=0;\n ll l=0;\n for(int i=0;i<=6*N;i++){\n if(l==M+1)break;\n if(ans[l]>i+1-EPS)continue;\n ll ok=l,ng=M+1;\n while(ng-ok>1){\n ll mid=(ok+ng)/2;\n Matrixmat(2,2);\n mat[0][0]=p[i];\n mat[0][1]=e[i];\n mat[1][1]=1;\n mat^=mid-l;\n if(ans[l]*mat[0][0]+mat[0][1]mat(2,2);\n mat[0][0]=p[i];\n mat[0][1]=e[i];\n mat[1][1]=1;\n mat^=ok-l;\n ans[ok]=ans[l]*mat[0][0]+mat[0][1];\n if(ok+1<=M)ans[ok+1]=ans[ok]*p[i]+e[i];\n l=ok+1;\n }\n }\n cout<>N>>M;\n if(N==0&&M==0)break;\n Solve(N,M);\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3968,"score_of_the_acc":-0.0482,"final_rank":13},{"submission_id":"aoj_2887_9543681","code_snippet":"#include \n\nusing namespace std;\n\n#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\n#define rrep(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)\n#define ALL(v) (v).begin(), (v).end()\n#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())\n#define SZ(v) (int)v.size()\n#define MIN(v) *min_element(ALL(v))\n#define MAX(v) *max_element(ALL(v))\n#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())\n#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())\n\nusing uint = unsigned int;\nusing ll = long long int;\nusing ull = unsigned long long;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nconst int inf = 0x3fffffff;\nconst ll INF = 0x1fffffffffffffff;\n\ntemplate inline bool chmax(T &a, T b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate inline bool chmin(T &a, T b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate T ceil(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate T floor(T x, U y) {\n assert(y != 0);\n if (y < 0)\n x = -x, y = -y;\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\ntemplate int popcnt(T x) {\n return __builtin_popcountll(x);\n}\ntemplate int topbit(T x) {\n return (x == 0 ? -1 : 63 - __builtin_clzll(x));\n}\ntemplate int lowbit(T x) {\n return (x == 0 ? -1 : __builtin_ctzll(x));\n}\n\ntemplate \nostream &operator<<(ostream &os, const pair &p) {\n os << \"P(\" << p.first << \", \" << p.second << \")\";\n return os;\n}\ntemplate ostream &operator<<(ostream &os, const vector &vec) {\n os << \"{\";\n for (int i = 0; i < vec.size(); i++) {\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \", \");\n }\n os << \"}\";\n return os;\n}\ntemplate \nostream &operator<<(ostream &os, const map &map_var) {\n os << \"{\";\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << \"(\" << itr->first << \", \" << itr->second << \")\";\n itr++;\n if (itr != map_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\ntemplate ostream &operator<<(ostream &os, const set &set_var) {\n os << \"{\";\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end())\n os << \", \";\n itr--;\n }\n os << \"}\";\n return os;\n}\n#ifdef LOCAL\n#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)\n#else\n#define show(...) true\n#endif\ntemplate void _show(int i, T name) {\n cerr << '\\n';\n}\ntemplate \nvoid _show(int i, const T1 &a, const T2 &b, const T3 &...c) {\n for (; a[i] != ',' && a[i] != '\\0'; i++)\n cerr << a[i];\n cerr << \":\" << b << \" \";\n _show(i + 1, a, c...);\n}\n\n#include \n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed::value || is_same_v) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed::value || is_same_v) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate void rd(pair &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size::value) {\n auto &x = std::get(t);\n rd(x);\n rd_tuple(t);\n }\n}\ntemplate void rd(tuple &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate void rd(array &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate void rd(vector &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate void wt(const pair val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get(t);\n wt(x);\n wt_tuple(t);\n }\n}\ntemplate void wt(tuple tpl) {\n wt_tuple(tpl);\n}\ntemplate void wt(const array val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate void wt(const vector val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nint main() {\nwhile(1) {\n int N;\n ll M;\n cin >> N >> M;\n if (N == 0 && M == 0) return 0;\n int MAXS = N*6+1;\n vector V(MAXS, 0);\n V[0] = 1.0;\n rep(i,0,N) {\n rrep(j,0,MAXS) {\n V[j] = 0;\n rep(k,1,7) {\n if (j-k >= 0) V[j] += V[j-k] / 6;\n }\n }\n }\n vector A(MAXS+1,0), B(MAXS+1,0);\n rep(i,0,MAXS) A[i+1] = A[i] + V[i];\n rrep(i,0,MAXS) B[i] = B[i+1] + V[i] * (long double)i;\n long double ANS = 0.0;\n while(M>0) {\n int X = floor(ANS);\n if (X == N * 6) break;\n long double C = B[X+1] / (1.0 - A[X+1]);\n long long NG = 0, OK = M;\n while(OK - NG > 1) {\n long long MID = (OK + NG) / 2;\n if ((ANS - C) * pow(A[X+1], MID) + C >= X + 1) OK = MID;\n else NG = MID;\n }\n ANS = (ANS - C) * pow(A[X+1], OK) + C;\n M -= OK;\n }\n print(ANS);\n}\n}","accuracy":1,"time_ms":10,"memory_kb":3688,"score_of_the_acc":-0.0018,"final_rank":4},{"submission_id":"aoj_2887_9347677","code_snippet":"#include\nusing namespace std;\nusing ll=long long;\nusing ld=long double;\nconstexpr int MOD=998244353;\n#define rep(i,n) for(int i=0;i<(int)(n);i++)\n#define replr(i,l,r) for(int i=(l);i<(int)(r);i++)\n\nusing Mat=array,2>;\nconstexpr ld per6=1.0/6;\n\nMat matpow(Mat m,ll n){\n Mat ret;\n ret[0][0]=1,ret[0][1]=0,ret[1][0]=0,ret[1][1]=1;\n while(n>0){\n if(n%2){\n Mat n2;\n n2[0][0]=0,n2[0][1]=0,n2[1][0]=0,n2[1][1]=0;\n for(int i=0;i<2;i++){\n for(int j=0;j<2;j++){\n for(int k=0;k<2;k++){\n n2[i][j]+=ret[i][k]*m[k][j];\n }\n }\n }\n ret=n2;\n }\n Mat m2;\n m2[0][0]=0,m2[0][1]=0,m2[1][0]=0,m2[1][1]=0;\n for(int i=0;i<2;i++){\n for(int j=0;j<2;j++){\n for(int k=0;k<2;k++){\n m2[i][j]+=m[i][k]*m[k][j];\n }\n }\n }\n m=m2;\n n/=2;\n }\n return ret;\n}\n\nvoid solve(ll N,ll M){\n ll N6=N*6+1;\n vector p(N6);\n p[0]=1;\n for(int c=0;c=0;i--){\n ld s=0;\n for(int j=1;j<=6;j++){\n if(i-j>=0)s+=p[i-j]*per6;\n }\n p[i]=s;\n }\n }\n ld ans=0,pl=0,pr=0;\n for(int i=0;ii+1)continue;\n ll les=-1,tmp=M;\n while(tmp-les>1){\n ll mid=(tmp+les)/2;\n Mat m;\n m[0][0]=pl,m[0][1]=pr,m[1][0]=0,m[1][1]=1;\n Mat n=matpow(m,mid);\n if(n[0][0]*ans+n[0][1]>=i+1)tmp=mid;\n else les=mid;\n }\n {\n M-=tmp;\n Mat m;\n m[0][0]=pl,m[0][1]=pr,m[1][0]=0,m[1][1]=1;\n Mat n=matpow(m,tmp);\n ans=n[0][0]*ans+n[0][1];\n }\n }\n cout<>N>>M;\n if(N==0)break;\n solve(N,M);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3384,"score_of_the_acc":-0.0005,"final_rank":1},{"submission_id":"aoj_2887_9313537","code_snippet":"#include \nusing namespace std;\n\nusing ll = long long;\nusing vll = vector;\nusing vvll = vector;\nusing vvvll = vector;\nusing vd = vector;\nusing vvd = vector;\nusing vvvd = vector;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\ntemplate\nvoid chmax(T& p, T q) { if (p < q)p = q; };\n\nvvd mul(vvd A,vvd B){\n ll n=A.size();\n vvd res(n,vd(n,0));\n rep(i,n)rep(j,n)rep(k,n)res[i][j]+=A[i][k]*B[k][j];\n return res;\n}\n\nvvd mulpow(vvd A,ll N){\n ll n=A.size();\n vvd res(n,vd(n,0.0));\n rep(i,n)res[i][i]=1.0;\n while(N>0){\n if(N%2)res=mul(res,A);\n A=mul(A,A);\n N/=2;\n }\n return res;\n}\n\nvoid solve(ll N, ll M) {\n vector NUM(6*N+1,0.0),SUM(6*N+1,0.0);\n NUM[0]=1.0;\n rep(i,N){\n vector NN(6*N+1,0.0);\n rep(j,6*N+1){\n rep(k,6){\n if(j+k+1<=6*N){\n NN[j+k+1]+=NUM[j]/6.0;\n }\n }\n }\n swap(NN,NUM);\n }\n cout<=0;i--)SUM[i]+=SUM[i+1];\n\n double p=double(N*7)/2.0;\n\n if(M==1){\n cout<1){\n ll mid=(ok+ng)/2;\n vvd A={{NUM[flp],SUM[flp+1]},{0.0,1.0}};\n auto B=mulpow(A,mid-L);\n double u=B[0][0]*p+B[0][1]*1.0;\n if(u>double(flp+1)){\n ok=mid;\n }\n else {\n ng=mid;\n }\n }\n if(M> N >> M) {\n if (N == 0)return 0;\n solve(N, M);\n }\n\n}","accuracy":1,"time_ms":550,"memory_kb":3540,"score_of_the_acc":-0.3496,"final_rank":17},{"submission_id":"aoj_2887_9167224","code_snippet":"#include \nusing namespace std;\n\nusing ll = long long;\nusing ld = long double;\n\nbool is_end = false;\n\n\nconst ld EPS = 1e-3;\n\nvoid solve()\n{\n ll N, M; cin >> N >> M;\n if (N == 0 && M == 0)\n {\n is_end = true;\n return;\n }\n \n vector dice(6*N+1, 0.0);\n dice[0] = 1.0;\n for (int i = 1; i <= N; ++i)\n {\n vector copy = dice;\n for (int j = 0; j <= 6*i; ++j)\n {\n ld sum = 0.0;\n for (int k = 1; k <= 6; ++k)\n {\n if (j - k >= 0) sum += copy[j-k] / 6;\n }\n dice[j] = sum;\n }\n }\n \n vector> vec;\n vec.emplace_back(1, (ld)3.5 * N);\n \n cout << fixed << setprecision(20);\n while (1)\n {\n auto [id, dp0] = vec.back();\n int k = floor(dp0);\n assert(id <= M);\n \n if (abs(dp0 - (ld)6.0*N) < EPS)\n {\n cout << (ld)6.0 * N << endl;\n return;\n }\n \n assert(k <= 6 * N);\n \n ld P = 0.0, E = 0.0;\n for (int i = 0; i <= k; ++i) P += dice[i];\n for (int i = k+1; i <= 6*N; ++i) E += i * dice[i];\n ld ep = E / (1 - P);\n \n {\n ld dpm = (dp0 - ep) * pow(P, M - id) + ep;\n if ((int)floor(dpm) == k)\n {\n cout << fixed << setprecision(20);\n cout << dpm << endl;\n return;\n }\n }\n \n ll ng = M, ok = id;\n while (abs(ok - ng) > 1)\n {\n ll mid = (ok + ng) / 2;\n ld dpm = (dp0 - ep) * pow(P, mid - id) + ep;\n if ((int)floor(dpm) == k) ok = mid;\n else ng = mid; \n }\n \n ld ndp = (dp0 - ep) * pow(P, ng - id) + ep;\n vec.emplace_back(ng, ndp);\n \n }\n \n cout << -1 << endl;\n \n return;\n}\n\nint main()\n{\n while (!is_end)\n {\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3544,"score_of_the_acc":-0.0012,"final_rank":2},{"submission_id":"aoj_2887_6025659","code_snippet":"#line 1 \"/Users/nok0/Documents/Programming/nok0/cftemp.hpp\"\n#include \nusing namespace std;\n\n#pragma region Macros\n// rep macro\n#define foa(v, a) for(auto &v : a)\n#define REPname(a, b, c, d, e, ...) e\n#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)\n#define REP0(x) for(int i = 0; i < (x); ++i)\n#define REP1(i, x) for(int i = 0; i < (x); ++i)\n#define REP2(i, l, r) for(int i = (l); i < (r); ++i)\n#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))\n#define REPSname(a, b, c, ...) c\n#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)\n#define REPS0(x) for(int i = 1; i <= (x); ++i)\n#define REPS1(i, x) for(int i = 1; i <= (x); ++i)\n#define RREPname(a, b, c, d, e, ...) e\n#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)\n#define RREP0(x) for(int i = (x)-1; i >= 0; --i)\n#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)\n#define RREP2(i, r, l) for(int i = (r)-1; i >= (l); --i)\n#define RREP3(i, r, l, c) for(int i = (r)-1; i >= (l); i -= (c))\n#define RREPSname(a, b, c, ...) c\n#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)\n#define RREPS0(x) for(int i = (x); i >= 1; --i)\n#define RREPS1(i, x) for(int i = (x); i >= 1; --i)\n\n// name macro\n#define pb push_back\n#define eb emplace_back\n#define SZ(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\n#define popcnt(x) __builtin_popcountll(x)\ntemplate \nusing V = std::vector;\ntemplate \nusing VV = std::vector>;\ntemplate \nusing pqup = std::priority_queue, std::greater>;\nusing ll = long long;\nusing ld = long double;\nusing int128 = __int128_t;\nusing pii = std::pair;\nusing pll = std::pair;\n\n// input macro\ntemplate \nstd::istream &operator>>(std::istream &is, std::pair &p) {\n\tis >> p.first >> p.second;\n\treturn is;\n}\ntemplate \nstd::istream &operator>>(std::istream &is, std::vector &v) {\n\tfor(T &i : v) is >> i;\n\treturn is;\n}\nstd::istream &operator>>(std::istream &is, __int128_t &a) {\n\tstd::string s;\n\tis >> s;\n\t__int128_t ret = 0;\n\tfor(int i = 0; i < s.length(); i++)\n\t\tif('0' <= s[i] and s[i] <= '9')\n\t\t\tret = 10 * ret + s[i] - '0';\n\ta = ret * (s[0] == '-' ? -1 : 1);\n\treturn is;\n}\nnamespace scanner {\nvoid scan(int &a) { std::cin >> a; }\nvoid scan(long long &a) { std::cin >> a; }\nvoid scan(std::string &a) { std::cin >> a; }\nvoid scan(char &a) { std::cin >> a; }\nvoid scan(char a[]) { std::scanf(\"%s\", a); }\nvoid scan(double &a) { std::cin >> a; }\nvoid scan(long double &a) { std::cin >> a; }\ntemplate \nvoid scan(std::pair &p) { std::cin >> p; }\ntemplate \nvoid scan(std::vector &a) { std::cin >> a; }\nvoid INPUT() {}\ntemplate \nvoid INPUT(Head &head, Tail &...tail) {\n\tscan(head);\n\tINPUT(tail...);\n}\n} // namespace scanner\n#define VEC(type, name, size) \\\n\tstd::vector name(size); \\\n\tscanner::INPUT(name)\n#define VVEC(type, name, h, w) \\\n\tstd::vector> name(h, std::vector(w)); \\\n\tscanner::INPUT(name)\n#define INT(...) \\\n\tint __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LL(...) \\\n\tlong long __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define STR(...) \\\n\tstd::string __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define CHAR(...) \\\n\tchar __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define DOUBLE(...) \\\n\tdouble __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n#define LD(...) \\\n\tlong double __VA_ARGS__; \\\n\tscanner::INPUT(__VA_ARGS__)\n\n// output-macro\ntemplate \nstd::ostream &operator<<(std::ostream &os, const std::pair &p) {\n\tos << p.first << \" \" << p.second;\n\treturn os;\n}\ntemplate \nstd::ostream &operator<<(std::ostream &os, const std::vector &a) {\n\tfor(int i = 0; i < int(a.size()); ++i) {\n\t\tif(i) os << \" \";\n\t\tos << a[i];\n\t}\n\treturn os;\n}\nstd::ostream &operator<<(std::ostream &dest, __int128_t &value) {\n\tstd::ostream::sentry s(dest);\n\tif(s) {\n\t\t__uint128_t tmp = value < 0 ? -value : value;\n\t\tchar buffer[128];\n\t\tchar *d = std::end(buffer);\n\t\tdo {\n\t\t\t--d;\n\t\t\t*d = \"0123456789\"[tmp % 10];\n\t\t\ttmp /= 10;\n\t\t} while(tmp != 0);\n\t\tif(value < 0) {\n\t\t\t--d;\n\t\t\t*d = '-';\n\t\t}\n\t\tint len = std::end(buffer) - d;\n\t\tif(dest.rdbuf()->sputn(d, len) != len) {\n\t\t\tdest.setstate(std::ios_base::badbit);\n\t\t}\n\t}\n\treturn dest;\n}\ntemplate \nvoid print(const T a) { std::cout << a << '\\n'; }\ntemplate \nvoid print(Head H, Tail... T) {\n\tstd::cout << H << ' ';\n\tprint(T...);\n}\ntemplate \nvoid printel(const T a) { std::cout << a << '\\n'; }\ntemplate \nvoid printel(const std::vector &a) {\n\tfor(const auto &v : a)\n\t\tstd::cout << v << '\\n';\n}\ntemplate \nvoid printel(Head H, Tail... T) {\n\tstd::cout << H << '\\n';\n\tprintel(T...);\n}\nvoid Yes(const bool b = true) { std::cout << (b ? \"Yes\\n\" : \"No\\n\"); }\nvoid No() { std::cout << \"No\\n\"; }\nvoid YES(const bool b = true) { std::cout << (b ? \"YES\\n\" : \"NO\\n\"); }\nvoid NO() { std::cout << \"NO\\n\"; }\nvoid err(const bool b = true) {\n\tif(b) {\n\t\tstd::cout << \"-1\\n\", exit(0);\n\t}\n}\n\n//debug macro\nnamespace debugger {\ntemplate \nvoid view(const std::vector &a) {\n\tstd::cerr << \"{ \";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << v << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\ntemplate \nvoid view(const std::vector> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &v : a) {\n\t\tstd::cerr << \"\\t\";\n\t\tview(v);\n\t\tstd::cerr << \"\\n\";\n\t}\n\tstd::cerr << \"}\";\n}\ntemplate \nvoid view(const std::vector> &a) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : a) std::cerr << \"\\t(\" << p.first << \", \" << p.second << \")\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate \nvoid view(const std::map &m) {\n\tstd::cerr << \"{\\n\";\n\tfor(const auto &p : m) std::cerr << \"\\t[\" << p.first << \"] : \" << p.second << \"\\n\";\n\tstd::cerr << \"}\";\n}\ntemplate \nvoid view(const std::pair &p) { std::cerr << \"(\" << p.first << \", \" << p.second << \")\"; }\ntemplate \nvoid view(const std::set &s) {\n\tstd::cerr << \"{ \";\n\tfor(auto &v : s) {\n\t\tview(v);\n\t\tstd::cerr << \", \";\n\t}\n\tstd::cerr << \"\\b\\b }\";\n}\n\ntemplate \nvoid view(const T &e) { std::cerr << e; }\n} // namespace debugger\n#ifdef LOCAL\nvoid debug_out() {}\ntemplate \nvoid debug_out(Head H, Tail... T) {\n\tdebugger::view(H);\n\tstd::cerr << \", \";\n\tdebug_out(T...);\n}\n#define debug(...) \\\n\tdo { \\\n\t\tstd::cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"] : [\"; \\\n\t\tdebug_out(__VA_ARGS__); \\\n\t\tstd::cerr << \"\\b\\b]\\n\"; \\\n\t} while(false)\n#else\n#define debug(...) (void(0))\n#endif\n\n// vector macro\ntemplate \nint lb(const std::vector &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }\ntemplate \nint ub(const std::vector &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }\ntemplate \nvoid UNIQUE(std::vector &a) {\n\tstd::sort(a.begin(), a.end());\n\ta.erase(std::unique(a.begin(), a.end()), a.end());\n}\ntemplate \nstd::vector press(std::vector &a) {\n\tauto res = a;\n\tUNIQUE(res);\n\tfor(auto &v : a)\n\t\tv = lb(res, v);\n\treturn res;\n}\n#define SORTname(a, b, c, ...) c\n#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)\n#define SORT0(a) std::sort((a).begin(), (a).end())\n#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })\ntemplate \nvoid ADD(std::vector &a, const T x = 1) {\n\tfor(auto &v : a) v += x;\n}\ntemplate \nvoid SUB(std::vector &a, const T x = 1) {\n\tfor(auto &v : a) v -= x;\n}\nstd::vector> rle(const string &s) {\n\tint n = s.size();\n\tstd::vector> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and s[l] == s[r]; r++) {}\n\t\tret.emplace_back(s[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\ntemplate \nstd::vector> rle(const std::vector &v) {\n\tint n = v.size();\n\tstd::vector> ret;\n\tfor(int l = 0; l < n;) {\n\t\tint r = l + 1;\n\t\tfor(; r < n and v[l] == v[r]; r++) {}\n\t\tret.emplace_back(v[l], r - l);\n\t\tl = r;\n\t}\n\treturn ret;\n}\nstd::vector iota(int n) {\n\tstd::vector p(n);\n\tstd::iota(p.begin(), p.end(), 0);\n\treturn p;\n}\ntemplate \nstruct cum_vector {\npublic:\n\tcum_vector() = default;\n\ttemplate \n\tcum_vector(const std::vector &vec) : cum((int)vec.size() + 1) {\n\t\tfor(int i = 0; i < (int)vec.size(); i++)\n\t\t\tcum[i + 1] = cum[i] + vec[i];\n\t}\n\tT prod(int l, int r) {\n\t\treturn cum[r] - cum[l];\n\t}\n\nprivate:\n\tstd::vector cum;\n};\n\n// math macro\ntemplate \ninline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }\ntemplate \ninline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }\ntemplate \nT divup(T x, T y) { return (x + y - 1) / y; }\ntemplate \nT POW(T a, long long n) {\n\tT ret = 1;\n\twhile(n) {\n\t\tif(n & 1) ret *= a;\n\t\ta *= a;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\n// modpow\nlong long POW(long long a, long long n, const int mod) {\n\tlong long ret = 1;\n\ta = (a % mod + mod) % mod;\n\twhile(n) {\n\t\tif(n & 1) (ret *= a) %= mod;\n\t\t(a *= a) %= mod;\n\t\tn >>= 1;\n\t}\n\treturn ret;\n}\ntemplate \nT bin_search(T ok, T ng, const F &f) {\n\twhile(abs(ok - ng) > 1) {\n\t\tT mid = (ok + ng) >> 1;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\ntemplate \nT bin_search(T ok, T ng, const F &f, int loop) {\n\tfor(int i = 0; i < loop; i++) {\n\t\tT mid = (ok + ng) / 2;\n\t\t(f(mid) ? ok : ng) = mid;\n\t}\n\treturn ok;\n}\n\n// others\nstruct fast_io {\n\tfast_io() {\n\t\tios::sync_with_stdio(false);\n\t\tcin.tie(nullptr);\n\t\tcout << fixed << setprecision(15);\n\t}\n} fast_io_;\nconst int inf = 1e9;\nconst ll INF = 1e18;\n#pragma endregion\n\nvoid main_();\n\nint main() {\n\tmain_();\n\treturn 0;\n}\n#line 5 \"/Users/nok0/Documents/Programming/nok0/math/matrix.hpp\"\n\ntemplate \nstruct matrix {\nprivate:\n\tstd::vector> A;\n\n\tstatic matrix I(size_t n) {\n\t\tmatrix mat(n);\n\t\tfor(int i = 0; i < n; i++) mat[i][i] = 1;\n\t\treturn mat;\n\t}\n\npublic:\n\tmatrix() = default;\n\n\tmatrix(std::vector> &vvec) { A = vvec; }\n\n\tmatrix(size_t n, size_t m) : A(n, std::vector(m, 0)) {}\n\n\tmatrix(size_t n, size_t m, T init) : A(n, std::vector(m, init)) {}\n\n\tmatrix(size_t n, std::vector &vec) : A(n, vec) {}\n\n\tmatrix(size_t n) : A(n, std::vector(n, 0)) {}\n\n\tsize_t height() const { return A.size(); }\n\n\tsize_t width() const { return A[0].size(); }\n\n\tinline const std::vector &operator[](int k) const {\n\t\treturn A[k];\n\t}\n\n\tinline std::vector &operator[](int k) {\n\t\treturn A[k];\n\t}\n\n\tmatrix &operator+=(const matrix &B) {\n\t\tsize_t n = height(), m = width();\n\t\tassert(n == B.height() and m == B.width());\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\t(*this)[i][j] += B[i][j];\n\t\treturn *this;\n\t}\n\n\tmatrix &operator-=(const matrix &B) {\n\t\tsize_t n = height(), m = width();\n\t\tassert(n == B.height() and m == B.width());\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\t(*this)[i][j] -= B[i][j];\n\t\treturn *this;\n\t}\n\n\tmatrix &operator*=(const matrix &B) {\n\t\tsize_t n = height(), m = B.width(), p = width();\n\t\tassert(p == B.height());\n\t\tstd::vector> C(n, std::vector(m, 0));\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\tfor(int k = 0; k < p; k++)\n\t\t\t\t\tC[i][j] += (*this)[i][k] * B[k][j];\n\t\tA.swap(C);\n\t\treturn *this;\n\t}\n\n\tmatrix &operator^=(long long k) {\n\t\tmatrix B = matrix::I(height());\n\t\twhile(k > 0) {\n\t\t\tif(k & 1) B *= (*this);\n\t\t\t*this *= *this;\n\t\t\tk >>= 1ll;\n\t\t}\n\t\tA.swap(B.A);\n\t\treturn *this;\n\t}\n\n\tbool operator==(const matrix &B) {\n\t\tsize_t n = height(), m = width();\n\t\tif(n != B.height() or m != B.width()) return false;\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\tif((*this)[i][j] != B[i][j]) return false;\n\t\treturn true;\n\t}\n\n\tmatrix operator+(const matrix &B) const {\n\t\treturn (matrix(*this) += B);\n\t}\n\n\tmatrix operator-(const matrix &B) const {\n\t\treturn (matrix(*this) -= B);\n\t}\n\n\tmatrix operator*(const matrix &B) const {\n\t\treturn (matrix(*this) *= B);\n\t}\n\n\tmatrix operator^(const long long &k) const {\n\t\treturn (matrix(*this) ^= k);\n\t}\n\n\tmatrix &operator+=(const T &t) {\n\t\tint n = height(), m = width();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\t(*this)[i][j] += t;\n\t\treturn *this;\n\t}\n\n\tmatrix &operator-=(const T &t) {\n\t\tint n = height(), m = width();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\t(*this)[i][j] -= t;\n\t\treturn *this;\n\t}\n\n\tmatrix &operator*=(const T &t) {\n\t\tint n = height(), m = width();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\t(*this)[i][j] *= t;\n\t\treturn *this;\n\t}\n\n\tmatrix &operator/=(const T &t) {\n\t\tint n = height(), m = width();\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\t(*this)[i][j] /= t;\n\t\treturn *this;\n\t}\n\n\tmatrix operator+(const T &t) const {\n\t\treturn (matrix(*this) += t);\n\t}\n\n\tmatrix operator-(const T &t) const {\n\t\treturn (matrix(*this) -= t);\n\t}\n\n\tmatrix operator*(const T &t) const {\n\t\treturn (matrix(*this) *= t);\n\t}\n\n\tmatrix operator/(const T &t) const {\n\t\treturn (matrix(*this) /= t);\n\t}\n\n\tfriend std::ostream &operator<<(std::ostream &os, matrix &p) {\n\t\tsize_t n = p.height(), m = p.width();\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tos << '[';\n\t\t\tfor(int j = 0; j < m; j++)\n\t\t\t\tos << p[i][j] << (j == m - 1 ? \"]\\n\" : \",\");\n\t\t}\n\t\treturn (os);\n\t}\n\n\tT determinant() {\n\t\tmatrix B(*this);\n\t\tsize_t n = height(), m = width();\n\t\tassert(n == m);\n\t\tT ret = 1;\n\t\tfor(int i = 0; i < n; i++) {\n\t\t\tint idx = -1;\n\t\t\tfor(int j = i; j < n; j++)\n\t\t\t\tif(B[j][i] != 0) idx = j;\n\t\t\tif(idx == -1) return 0;\n\t\t\tif(i != idx) {\n\t\t\t\tret *= -1;\n\t\t\t\tswap(B[i], B[idx]);\n\t\t\t}\n\t\t\tret *= B[i][i];\n\t\t\tT vv = B[i][i];\n\t\t\tfor(int j = 0; j < n; j++) B[i][j] /= vv;\n\t\t\tfor(int j = i + 1; j < n; j++) {\n\t\t\t\tT a = B[j][i];\n\t\t\t\tfor(int k = 0; k < n; k++) {\n\t\t\t\t\tB[j][k] -= B[i][k] * a;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn ret;\n\t}\n\n\tmatrix inv() {\n\t\tint n = height();\n\t\tif(determinant() == T(0)) return matrix(0);\n\t\tmatrix a(*(this)), l = I(n), u(n);\n\t\tfor(int j = 0; j < n; j++) u[0][j] = a[0][j];\n\t\tfor(int j = 1; j < n; j++) l[j][0] = a[j][0] / u[0][0];\n\t\tfor(int k = 1; k < n; k++) {\n\t\t\tfor(int j = k; j < n; j++)\n\t\t\t\tfor(int i = 0; i < k; i++) a[j][k] -= l[j][i] * u[i][k];\n\t\t\tu[k][k] = a[k][k];\n\t\t\tfor(int j = k + 1; j < n; j++) {\n\t\t\t\tu[k][j] = a[k][j];\n\t\t\t\tfor(int i = 0; i < k; i++)\n\t\t\t\t\tu[k][j] -= l[k][i] * u[i][j];\n\t\t\t}\n\t\t\tfor(int j = k + 1; j < n; j++) l[j][k] = a[j][k] / u[k][k];\n\t\t}\n\t\tmatrix x(n), y = I(n);\n\t\tfor(int i = 0; i < n; i++)\n\t\t\tfor(int j = 0; j < n; j++) {\n\t\t\t\tfor(int k = 0; k < j; k++) y[j][i] -= l[j][k] * y[k][i];\n\t\t\t}\n\t\tT sigma;\n\t\tfor(int h = 0; h < n; h++)\n\t\t\tfor(int i = n - 1; i >= 0; i--) {\n\t\t\t\tsigma = y[i][h];\n\t\t\t\tfor(int j = i + 1; j < n; j++) {\n\t\t\t\t\tsigma -= u[i][j] * x[j][h];\n\t\t\t\t}\n\t\t\t\tx[i][h] = sigma / u[i][i];\n\t\t\t}\n\t\treturn move(x);\n\t}\n};\n#line 3 \"g.cpp\"\n\nint n;\nll m;\ndouble solve() {\n\t//出目の和がpを求めるパート\n\tV p(n * 6 + 1);\n\n\tV saikoro = {1};\n\tfor(int i = 0; i < n; i++) {\n\t\tvector new_saikoro(saikoro.size() + 6);\n\t\tfor(int j = 1; j <= 6; j++) {\n\t\t\tfor(int k = 0; k < saikoro.size(); k++) {\n\t\t\t\tnew_saikoro[k + j] += saikoro[k] / 6;\n\t\t\t}\n\t\t}\n\t\tsaikoro = new_saikoro;\n\t}\n\tp = saikoro;\n\n\t//p1[i] = 1 ~ i の和\n\tvector p1(6 * n + 1);\n\tREPS(i, 6 * n) {\n\t\tp1[i] = p1[i - 1] + p[i] * i;\n\t}\n\tcum_vector p2(p);\n\tdouble ret = n * 3.5;\n\tll nokori = m - 1;\n\twhile(nokori > 0) {\n\t\t//(a_n ,1) にmul かけて (a_{n-1}, 1) を得る.\n\t\tint fl = floor(ret);\n\t\tmatrix def(1, 2);\n\t\tdef[0][0] = ret;\n\t\tdef[0][1] = 1;\n\t\tmatrix mul(2, 2);\n\t\tmul[0][0] = p2.prod(1, fl + 1);\n\t\tmul[0][1] = 0;\n\t\tmul[1][0] = p1[6 * n] - p1[fl];\n\t\tmul[1][1] = 1;\n\t\tdouble tmp = (def * (mul ^ nokori))[0][0];\n\t\tif(floor(tmp) == fl) {\n\t\t\tnokori = 0;\n\t\t\tret = tmp;\n\t\t} else {\n\t\t\t//にぶたん？\n\t\t\tauto f = [&](ll mid) -> bool {\n\t\t\t\treturn floor((def * (mul ^ mid))[0][0]) == fl;\n\t\t\t};\n\t\t\tauto cnt = bin_search(0ll, nokori, f) + 1;\n\t\t\tnokori -= cnt;\n\t\t\tret = (def * (mul ^ cnt))[0][0];\n\t\t}\n\t}\n\treturn ret;\n}\n\nvoid main_() {\n\twhile(cin >> n >> m, n) {\n\t\tprint(solve());\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":3648,"score_of_the_acc":-0.0339,"final_rank":9},{"submission_id":"aoj_2887_6025609","code_snippet":"#pragma GCC ta g(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include \nusing namespace std;\n#define DEBUG\n#ifdef DEBUG\ntemplate \nostream &operator<<(ostream &os, const pair &p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate ostream &operator<<(ostream &os, const vector &v) {\n os << '{';\n for(int i = 0; i < (int)v.size(); i++) {\n if(i) { os << ','; }\n os << v[i];\n }\n os << '}';\n return os;\n}\nvoid debugg() { cerr << endl; }\ntemplate \nvoid debugg(const T &x, const Args &... args) {\n cerr << \" \" << x;\n debugg(args...);\n}\n#define debug(...) \\\n cerr << __LINE__ << \" [\" << #__VA_ARGS__ << \"]: \", debugg(__VA_ARGS__)\n#define dump(x) cerr << __LINE__ << \" \" << #x << \" = \" << (x) << endl\n#else\n#define debug(...) (void(0))\n#define dump(x) (void(0))\n#endif\nusing namespace std;\ntypedef long long ll;\ntypedef vector vl;\ntypedef vector vvl;\ntypedef vector vc;\ntypedef vector vs;\ntypedef vector vb;\ntypedef vector vd;\ntypedef pair P;\ntypedef pair pii;\ntypedef vector
vpl;\ntypedef tuple