2013 ACM-ICPC吉林通化全国邀请赛 J-Dice 概率DP + 数列

HDU-4599

solution

$已知d{p}_i[n]=0,(i=1,2)$

$d{p}_1[i]=d{p}_1[i+1]\ast \frac{5}{6}+d{p}_1[1]\ast \frac{1}{6}+1$

$=>d{p}_1[n]-(d{p}_1[1]+\frac{5}{6})=6[d{p}_1[n-1]-(d{p}_1[1]+\frac{5}{6})]，d{p}_1[0]=d{p}_1[1]+1$

$=>d{p}_1[n]-d{p}_1[1]-\frac{6}{5}=-\frac{6^n}{5}$

$=>d{p}_1[1]+\frac{6}{5}=\frac{6^n}{5}=>d{p}_1[0]=\frac{6^n-1}{5}$

同理，

$d{p}_2[0]=6\ast \frac{6^n-1}{5}$

$显然G(n)=6\ast n$

$求最小的M_1,M_2使得，G(M_1)>=F(N)，G(M_2)>=H(N)，$

$其中F(N)=d{p}_1[0]，H(N)=d{p}_2[0].$

于是有，

$M_1>=ceil(\frac{6^n-1}{30})=\frac{6^n+24}{30}，M_2>=\frac{6^n-1}{5}$

code

/*SiberianSquirrel*/
/*CuteKiloFish*/
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const double PI = acos(-1), eps = 1e-6;
/*const int MOD = 998244353, r = 119, k = 23, g = 3;
const int MOD = 1004535809, r = 479, k = 21, g = 3;*/
const int INF = 0x3f3f3f3f, MOD = 2011;
const int M = 3e2 + 10, N = 5e6 + 10;
int sgn(double x) {
    if(fabs(x) < eps) return 0;
    return x < 0? -1: 1;
}
//inline int rnd(){static int seed=2333;return seed=(((seed*666666ll+20050818)%998244353)^1000000007)%1004535809;}
//double Rand() {return (double)rand() / RAND_MAX;}

ll n;

ll quick_pow(ll ans, ll p, ll res = 1) {
    ans %= MOD, p %= MOD - 1;
    for(; p; p >>= 1, ans = ans * ans % MOD)
        if(p & 1) res = res * ans % MOD;
    return res % MOD;
}

ll inv(ll ans) {
    return quick_pow(ans, MOD - 2);
}

void init() {}

void solve(double _p = 0) {
    cout << ((quick_pow(6, n) + 24 + MOD) % MOD * inv(30) % MOD) << ' ';
    cout << (quick_pow(6, n) - 1 + MOD) % MOD * inv(5) % MOD << endl;
}
/*


*/
int main() {
//    ios::sync_with_stdio(false);cin.tie(0);cout.tie(nullptr);
// srand(time(0));
#ifdef ACM_LOCAL
    freopen("input", "r", stdin);
    freopen("output", "w", stdout);
#endif
    init();
    int o = 1;
//	cin >> o;
    while(o --) {
        while(cin >> n && n) {
            solve();
        }
    }
    return 0;
}