joeylee97

2017年8月1日

摘要： Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 8109 Accepted: 3551 Special Judge Description Bessie's been appointed the new watch-cow for 阅读全文

posted @ 2017-08-01 16:22 joeylee97 阅读(270) 评论(0) 推荐(0) 编辑

Bellman_ford 算法 Currency Exchange POJ1860

摘要： Bellman_ford算法用于寻找正环或者负环！算法导论： 24.1 The Bellman-Ford algorithm The Bellman-Ford algorithm solves the single-source shortest-paths problem in the gene 阅读全文

posted @ 2017-08-01 12:46 joeylee97 阅读(168) 评论(0) 推荐(0) 编辑

Frame Stacking 拓扑排序图论

摘要： Description Consider the following 5 picture frames placed on an 9 x 8 array. ........ ........ ........ ........ .CCC.... EEEEEE.. ........ ........ 阅读全文

posted @ 2017-08-01 10:47 joeylee97 阅读(194) 评论(0) 推荐(0) 编辑

S - Arc of Dream 矩阵快速幂

摘要： An Arc of Dream is a curve defined by following function: where a 0 = A0 a i = a i-1*AX+AY b 0 = B0 b i = b i-1*BX+BY What is the value of AoD(N) modu 阅读全文

posted @ 2017-08-01 08:56 joeylee97 阅读(185) 评论(0) 推荐(0) 编辑

2017年7月30日

Contemplation! Algebra 矩阵快速幂

摘要： Given the value of a+b and ab you will have to find the value of a n + b n Input The input file contains several lines of inputs. Each line except the 阅读全文

posted @ 2017-07-30 09:29 joeylee97 阅读(196) 评论(0) 推荐(0) 编辑

2017年7月29日

Power of Matrix 等比数列求和矩阵版！

摘要： #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long LL; typedef unsigned long long ULL; #define MAXN 4... 阅读全文

posted @ 2017-07-29 19:42 joeylee97 阅读(635) 评论(0) 推荐(0) 编辑

Yet another Number Sequence 矩阵快速幂

摘要： Let’s define another number sequence, given by the following function: f(0) = a f(1) = b f(n) = f(n − 1) + f(n − 2), n > 1 When a = 0 and b = 1, this 阅读全文

posted @ 2017-07-29 17:17 joeylee97 阅读(283) 评论(0) 推荐(0) 编辑

2017年7月28日

F - Experienced Endeavour 矩阵快速幂

摘要： Alice is given a list of integers by Bob and is asked to generate a new list where each element in the new list is the sum of some other integers in t 阅读全文

posted @ 2017-07-28 16:03 joeylee97 阅读(210) 评论(0) 推荐(0) 编辑

Fast Matrix Calculation 矩阵快速幂

摘要： One day, Alice and Bob felt bored again, Bob knows Alice is a girl who loves math and is just learning something about matrix, so he decided to make a 阅读全文

posted @ 2017-07-28 15:13 joeylee97 阅读(442) 评论(0) 推荐(0) 编辑

2017年7月27日

STL源码剖析学习笔记 MiniSTL

摘要： https://github.com/joeyleeeeeee97 目录：第二章空间适配器第三章迭代器第四章序列式容器（vector,list,deque,stack,heap,priority_queue,slist) 第五章关联式容器(树的算法 + RB_tree ,set,map 阅读全文

posted @ 2017-07-27 10:54 joeylee97 阅读(1548) 评论(0) 推荐(0) 编辑

公告