tabris的博客

[原创]各种乱七八糟的模板 【不定期补充】[C++语言描述] 2016-07-17 16:12:39 Tabris_ 阅读数：405 博客爬取于2020-06-14 22:39:17 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51932828 矩阵快速幂 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051struct Matrix{ // int r,c; //C行R列 LL m[66][66];};Matrix operator * (Matrix a,Matrix b){ Matrix c; for(int i=0; i<M; i++) //初始化矩阵 for(int j=0; j<M; j++) c. ...

[原创]POJ 3233 Matrix Power Series 【矩阵快速幂+等比矩阵】 2016-07-17 12:56:31 Tabris_ 阅读数：295 博客爬取于2020-06-14 22:44:11 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51931853 题目连接 : http://poj.org/problem?id=3233 Matrix Power Series Time Limit: 3000MS Memory Limit: 131072K Total Submissions: 20125 Accepted: 8449 Description Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak. Input The input contains exactly one test cas ...

[原创]POJ 3070 Fibonacci 【矩阵快速幂】 2016-07-17 09:37:27 Tabris_ 阅读数：261 博客爬取于2020-06-14 22:44:13 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51930813 题目连接 ： http://poj.org/problem?id=3070 Fibonacci Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 12738 Accepted: 9065 Description In the Fibonacci integer sequence, F0 = 0, F1 = 1, and Fn = Fn − 1 + Fn − 2 for n ≥ 2. For example, the first ten terms of the Fibonacci sequence are: 0, 1, 1 ...

[原创]HDU 5317 RGCDQ 【筛法+前缀记录】 2016-07-16 19:16:49 Tabris_ 阅读数：164 博客爬取于2020-06-14 22:44:14 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51925879 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=5317 RGCDQ Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2667 Accepted Submission(s): 1060 Problem Description Mr. Hdu is interested in Greatest Common Divisor (GCD). He wants to find more and m ...

[原创]LightOJ 1090 Trailing Zeroes (II) [分解]【数论】 2016-07-03 16:45:29 Tabris_ 阅读数：369 博客爬取于2020-06-14 22:44:15 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51815810 题目链接 ：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=120197#problem/Y Trailing Zeroes (II) Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1090 Description Find the number of trailing zeroes for the following functio ...

[原创]UVA 10780 Again Prime? No Time. [质因子分解]【数论】 2016-07-02 16:42:00 Tabris_ 阅读数：328 博客爬取于2020-06-14 22:44:16 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51811570 题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=120197#problem/H The problem statement is very easy. Given a number n you have to determine the largest power of m, not necessarily prime, that divides n!. Input The input file consists of several test cases. The first line in th ...

[原创]Light 1045 Digits of Factorial 【数论】 2016-06-30 15:54:37 Tabris_ 阅读数：241 博客爬取于2020-06-14 22:44:17 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51791054 题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=120197#problem/U Digits of Factorial Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Description Factorial of an integer is defined by the following function f(0) = 1 f(n) = f(n - 1) * n, i ...

[原创]LightOJ 1035 Intelligent Factorial Factorization [预处理+一半的 质因子分解]【数论】 2016-06-29 16:32:35 Tabris_ 阅读数：305 博客爬取于2020-06-14 22:44:18 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51783994 题目链接：LightOJ 1035 Intelligent Factorial Factorization Intelligent Factorial Factorization Time Limit:500MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Description Given an integer N, you have to prime factorize N! (factorial N). Inp ...

[原创]Light OJ 1014 Ifter Party [因子分解]【数论】 2016-06-29 15:13:15 Tabris_ 阅读数：415 博客爬取于2020-06-14 22:44:19 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51783218 题目链接 ： http://acm.hust.edu.cn/vjudge/contest/view.action?cid=120197#problem/Q – Ifter Party Time Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Description I have an Ifter party at the 5th day of Ramadan for the contestants. For this reason I have invi ...

[原创]UVA 11029 Leading and Trailing [数学] 2016-06-28 21:47:05 Tabris_ 阅读数：244 博客爬取于2020-06-14 22:44:20 以下为正文 版权声明：本文为Tabris原创文章，未经博主允许不得私自转载。 https://blog.csdn.net/qq_33184171/article/details/51779048 Apart from the novice programmers, all others know that you can’t exactly represent numbers raised to some high power. For example, the C function pow(125456, 455) can be represented in double data type format, but you won’t get all the digits of the result. However we can get at least some sati ...