![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
----------数学问题----------
Detective-Conan
且随疾风前行 身后亦须留心
展开
-
(模板题)sdut 3359 高数Umaru系列(10)——简单题(矩阵快速幂)
高数Umaru系列(10)——简单题Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述题目描述很简单,已知递推式F(n)=a*F(n-1)+b*F(n-2),给定a,b,F(0),F(1)的值以及n,求F(n)。多组输入。对于每组输入,输出一个F(n),结果可能会比较大,需要对100000000原创 2016-07-23 14:52:41 · 322 阅读 · 0 评论 -
HDU 6063 RXD and math
RXD and mathTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 465 Accepted Submission(s): 242Problem DescriptionRXD is a good原创 2017-08-02 10:16:36 · 281 阅读 · 0 评论 -
HDU 6053 TrickGCD
TrickGCDTime Limit: 5000/2500 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 2073 Accepted Submission(s): 804Problem DescriptionYou are given原创 2017-07-29 22:12:58 · 329 阅读 · 0 评论 -
NEUQ 1768 一道简单的递推题
问题 F: 一道简单的递推题时间限制: 1 Sec 内存限制: 128 MB提交: 609 解决: 65[提交][状态][讨论版]题目描述存在如下递推式:F(n+1)=A1*F(n)+A2*F(n-1)+...+An*F(1)求第K项的值对1000000007取模的结果输入单组测试数据第一行输入两个整数 n , k (原创 2017-06-12 10:57:46 · 486 阅读 · 0 评论 -
HDU 5902 GCD is Funny(BestCoder #87 1001)
GCD is FunnyTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 250 Accepted Submission(s): 50Problem DescriptionAlex has invente原创 2016-09-25 10:41:43 · 792 阅读 · 0 评论 -
poj 1284 Primitive Roots
Primitive RootsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 4267 Accepted: 2501DescriptionWe say that integer x, 0 i mod p) | 1 <= i <= p-1 } is equa原创 2017-04-08 10:28:33 · 329 阅读 · 0 评论 -
(模板题)UVALive 7362 Farey(欧拉函数)
Root Regionals 2015 >> North America - Greater NY7362 - FareyTime limit: 3.000 seconds提示题意:有p(1分数格式:a/b,且a思路:不晓得欧拉函数的只能眼睁睁看人家AC刷刷的网上冒,心痛啊%>_直接套原创 2016-10-08 18:52:04 · 307 阅读 · 0 评论 -
poj 3252 Round Numbers
Round NumbersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12086 Accepted: 4570DescriptionThe cows, as you know, have no fingers or thumbs and thus ar原创 2016-08-15 11:21:23 · 254 阅读 · 0 评论 -
(模板题)poj 2115 C Looooops(扩展欧几里得算法)
C LooooopsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23790 Accepted: 6581DescriptionA Compiler Mystery: We are given a C-language style for loop of原创 2016-08-18 20:53:56 · 743 阅读 · 0 评论 -
poj 1845 Sumdiv
SumdivTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 19160 Accepted: 4814DescriptionConsider two natural numbers A and B. Let S be the sum of all natur原创 2016-08-18 14:28:53 · 302 阅读 · 0 评论 -
poj 2635 The Embarrassed Cryptographer
The Embarrassed CryptographerTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 14064 Accepted: 3838DescriptionThe young and very promising cryptographer O原创 2016-08-17 15:49:01 · 299 阅读 · 0 评论 -
poj 1942 Paths on a Grid
Paths on a GridTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 24690 Accepted: 6121DescriptionImagine you are attending your math lesson at school. Once原创 2016-08-17 10:34:34 · 244 阅读 · 0 评论 -
poj 1019 Number Sequence
Number SequenceTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 38061 Accepted: 11012DescriptionA single positive integer i is given. Write a program to原创 2016-08-16 21:34:45 · 420 阅读 · 0 评论 -
poj 1850 Code
CodeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 9322 Accepted: 4455DescriptionTransmitting and memorizing information is a task that requires differ原创 2016-08-15 22:03:11 · 251 阅读 · 0 评论 -
UVA 13277(UVALive 8083) XOR Path
题目链接:https://cn.vjudge.net/problem/UVA-13277,https://cn.vjudge.net/problem/UVALive-8083Time limit 1000 ms(UVA),3000 ms(UVALive)You are given an unrooted weighted tree. The weights on the edgesa...原创 2018-09-06 16:18:10 · 302 阅读 · 0 评论