int main()
{
while (true) {
scanf("%d%lf", &n, &p);
if (n == 0) break;
run_dp();
printf("%.8lf\n", ans);
}
return 0;
}
int main()
{
int T;
scanf("%d", &T);
int ncase = 0;
while (T--) {
scanf("%d%d", &m, &n);
for (int i = 0; i < m; ++i)
scanf("%d", &digits[i]);
printf("Case %d: %d\n", ++ncase, run_dp());
}
return 0;
}
int main()
{
run_dp();
while (true) {
if (scanf("%d%d", &N, &m) != 2) break;
u64 ans;
if (m == 1)
ans = N > 3 ? dp[N - 3][0][1] : 1;
else
ans = dp[N - m][m - 1][0];
printf("%llu\n", ans);
}
return 0;
}
int main()
{
prepare();
int T;
scanf("%d", &T);
int ncase = 0;
while (T--) {
scanf("%d%d%s", &base, &K, num);
D = strlen(num);
run_dp();
printf("Case %d: %lld\n", ++ncase, dp[(1 << D) - 1][0]);
}
return 0;
}
int main(){
int testcase,kase,count1,count2,ans;
scanf("%d",&testcase);
for(kase=1;kase<=testcase;kase++){
scanf("%d",&n);
for(count1=0;count1<n;count1++){
for(count2=0;count2<3;count2++)
scanf("%d",&prices[count1][count2]);
}
run_dp();
ans=min_dp();
printf("Case %d: %d\n",kase,ans);
}
return 0;
}
double run(double sigma, double c, int tau, int prec, dgs_disc_gauss_alg_t alg, size_t ntrials, unsigned long long *t) {
if (prec == MP)
return run_mp(sigma, c, tau, alg, ntrials, t);
else
return run_dp(sigma, c, tau, alg, ntrials, t);
}
