2013年8月27日
hdu 2815 Mod Tree
摘要： Mod TreeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3543Accepted Submission(s): 917Problem DescriptionThe picture indicates a tree, every node has 2 children.The depth of the nodes whose color is blue is 3; the depth of the node whose color is 阅读全文
posted @ 2013-08-27 08:48 芷水 阅读(265) 评论(0) 推荐(0) 编辑
poj 3243 Clever Y
摘要： Clever YTime Limit:5000MSMemory Limit:65536KTotal Submissions:5744Accepted:1376DescriptionLittle Y finds there is a very interesting formula in mathematics:XYmod Z = KGivenX,Y,Z, we all know how to figure outKfast. However, givenX,Z,K, could you figure outYfast?InputInput data consists of no more th 阅读全文
posted @ 2013-08-27 08:41 芷水 阅读(227) 评论(0) 推荐(0) 编辑
poj 2417 Discrete Logging ---高次同余第一种类型。babystep_gaint_step
摘要： Discrete LoggingTime Limit:5000MSMemory Limit:65536KTotal Submissions:2831Accepted:1391DescriptionGiven a prime P, 2 28 #include 29 #include 30 #include 31 #include 32 using namespace std; 33 34 typedef __int64 LL; 35 const int MAX=499991; 36 LL A,B,C; 37 bool Hash[MAX]; 38 LL idx[MAX]; 39 LL val[.. 阅读全文
posted @ 2013-08-27 08:35 芷水 阅读(569) 评论(0) 推荐(1) 编辑
fzou 1759 Super A^B mod C
摘要： Problem 1759 Super A^B mod CAccept: 456Submit: 1488Time Limit: 1000 mSecMemory Limit : 32768 KB Problem DescriptionGiven A,B,C, You should quickly calculate the result of A^B mod C. (111 #include12 #include13 #include14 using namespace std;15 16 char b[1000005];17 18 __int64 Euler(__int64 n)19 {20 . 阅读全文
posted @ 2013-08-27 08:30 芷水 阅读(1692) 评论(0) 推荐(0) 编辑