- 博客(9)
- 资源 (2)
- 收藏
- 关注
原创 [多校补题]2017 Multi-University Training Contest 7 solutions BY 杭州二中
1002(待补) 有一棵n个点的有根树,标号为0到n−1,iii号点的父亲是floor⌊ki−1⌋号点,求所有子树大小的异或和。1≤n,k≤1018。 这是一棵完全k叉树,考虑根的所有孩子,最多只有一个不是满k叉树,对这个孩子进行递归处理即可。k>1时只有log层,直接做就到底就好了,k=1时要特判。 1005 Euler theorem
2017-08-16 00:56:31 594
原创 [多校补题]2017 Multi-University Training Contest 6 solutions BY 福州大学
1003 Inversion Inversion Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 1826 Accepted Submission(s): 868 Problem Description
2017-08-16 00:42:28 400
原创 [多校补题]2017 Multi-University Training Contest 5 solutions BY 吉如一
1006 Rikka with Graph Rikka with Graph Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2377 Accepted Submission(s): 766 Problem
2017-08-16 00:32:16 1418
原创 [多校补题]2017 Multi-University Training Contest 4 solutions BY 陈松杨
1003. Counting Divisors 先去打一个1到1e6的素数表,然后去枚举每个素数在区间内的倍数,可以跳着枚举,计算出每个数对应的因子个数,对于每个数的因子个数就等于枚举的因子个数*k+1累乘起来。现场做的时候没想到,家旺想到了枚举根号r,简化运算,被我给否决了。。。。但是还是没有想到用根号r内的质数去再分解质因数。。。
2017-08-15 23:40:18 995
原创 [多校补题]2017 Multi-University Training Contest 3 solutions BY 洪华敦
1003 Kanade's sum Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2097 Accepted Submission(s): 164 Problem Description Give y
2017-08-15 20:14:32 498
原创 [多校补题]2017 Multi-University Training Contest 2 solutions BY 电子科技大学
1001: Is Derek lying? Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 3598 Accepted Submission(s): 999 Problem Description
2017-08-15 17:39:52 483
原创 [多校补题]2017 Multi-University Training Contest 1 solutions BY 北京航空航天大学
1001. Add More Zero Add More Zero Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 2245 Accepted Submission(s): 1053 Problem
2017-08-15 16:01:27 546
原创 史上最强大大数模版
#include #include #include using namespace std; #define DIGIT 4 //四位隔开,即万进制 #define DEPTH 10000 //万进制 #define MAX 100 typedef int bignum_t[MAX+1]; /********
2017-08-13 19:20:07 293
原创 Fibonacci 数列O(logn)解法
传统解法 提到斐波那契数列(Fibonacci Sequence),首先想到的是经典的动规(DP)算法。 时间复杂度O(n),这里空间复杂度可以优化到O(1)。代码如下: int fib_n(int n) { int dp[3] = {1, 1}; if (n 1) return dp[n]; for (int i = 2; i i)
2017-08-07 20:07:48 691
ACM常用算法大集合.pdf
2016-07-30
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人