茶飘香~

摘要： ACdrea 1217 高斯消元 Description The following problem is somehow related to the final stage of many famous integer factorization algorithms involved in s 阅读全文

摘要： ACdream 1214 矩阵连乘 Problem Description You might have noticed that there is the new fashion among rich people to have their yards tiled with black and 阅读全文

摘要： #include #include #include #include #include using namespace std; #define DIGIT 4 //四位隔开,即万进制 #define DEPTH 10000 //万进制 #define MAX 100+5 //题目最大位数/4，要不大直接设为最大位数也行 typedef... 阅读全文

摘要： Codeforces Round #346 (Div. 2) E. New Reform E. New Reform time limit per test 1 second memory limit per test 256 megabytes input standard input outpu 阅读全文

摘要： Description You all must know the puzzle named "The Towers of Hanoi". The puzzle has three pegs and N discs of different radii, initially all disks ar 阅读全文

摘要： Description Little frog Georgie likes to jump. Recently he have discovered the new playground that seems the perfect place to jump. Recently the new j 阅读全文

摘要： Description During the programming classes Vasya was assigned a difficult problem. However, he doesn't know how to code and was unable to find the sol 阅读全文

摘要： HDU 2577 Description Pirates have finished developing the typing software. He called Cathy to test his typing software. She is good at thinking. After 阅读全文

摘要： HDU 2159 Description 最近xhd正在玩一款叫做FATE的游戏，为了得到极品装备，xhd在不停的杀怪做任务。久而久之xhd开始对杀怪产生的厌恶感，但又不得不通过杀怪来升完这最后一级。现在的问题是，xhd升掉最后一级还需n的经验值，xhd还留有m的忍耐度，每杀一个怪xhd会得到相应的 阅读全文

摘要： NEFU专项训练十和十一——树链剖分 Description 一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作： I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节点的最大权值 I 阅读全文