随笔分类 -  高精/大数

摘要:ZOJ- Numbers (贪心,枚举,大数) 题面: 题意: 给定大整数$n,m$,让你选择$\mathit m$个非负整数$a_1, a_2, \dots, a_m$,使其满足: \[ n=a_1 + a_2 + \dots + a_m \] 问你下式最小是多少? \[ a_1 \text{ O 阅读全文
posted @ 2020-11-03 00:48 茄子Min 阅读(83) 评论(0) 推荐(0)
摘要:BBP Formula (数学) 链接: HDU - 6217 题面: 思路: 原式: \[ \pi=\sum_{k=0}^{\infty}\frac{1}{16^k}({\frac{4}{8k+1}-\frac{2}{8k+4}-\frac{1}{8k+5}-\frac{1}{8k+6}}) \] 阅读全文
posted @ 2020-10-20 20:37 茄子Min 阅读(143) 评论(0) 推荐(0)
摘要:链接:https://ac.nowcoder.com/acm/contest/1072/L?&headNav=acm&headNav=acm 来源:牛客网 乘积最大 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format 阅读全文
posted @ 2019-08-13 19:25 茄子Min 阅读(189) 评论(0) 推荐(0)
摘要:链接:https://ac.nowcoder.com/acm/contest/160/C 来源:牛客网 多项式 时间限制:C/C++ 1秒,其他语言2秒 空间限制:C/C++ 262144K,其他语言524288K 64bit IO Format: %lld 题目描述 求\lim\limits_{x 阅读全文
posted @ 2019-08-02 12:33 茄子Min 阅读(488) 评论(0) 推荐(0)
摘要:``` cpp const int MAXN=150; struct bign { int len, s[MAXN]; bign () { memset(s, 0, sizeof(s)); len = 1; } bign (int num) { this = num; } bign (const c 阅读全文
posted @ 2019-08-02 11:38 茄子Min 阅读(178) 评论(0) 推荐(0)
摘要:``` cpp int ten[4] = {1,10,100,1000}; typedef struct BigNumber { int d[1200]; BigNumber(string s) { int i, j, k, len; len = s.size(); d[0] = (len-1)/4+1; fo... 阅读全文
posted @ 2019-08-02 11:37 茄子Min 阅读(221) 评论(0) 推荐(0)
摘要:题目描述: 在lfx高尚又有趣的灵魂的影响下,我想出一个简短而优美的题目。 This is too simple a question. Given an integer N, find the value of this formula C (n, 0)+C (n, 1)+C (n, 2)+... 阅读全文
posted @ 2019-02-17 23:47 茄子Min 阅读(259) 评论(0) 推荐(0)
摘要:A continued fraction of height n is a fraction of form . You are given two rational numbers, one is represented as and the other one is represented as 阅读全文
posted @ 2019-01-30 21:50 茄子Min 阅读(209) 评论(0) 推荐(0)