2015年11月______________kk

原创 hdu5558 Alice's Classified Message

Alice's Classified MessageTime Limit: 16000/8000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 33 Accepted Submission(s): 11Problem Description

2015-11-14 22:24:31 2017

原创 hdu5536Chip Factory

算机学院大学生程序设计竞赛（新生为主） Chip FactoryTime Limit: 18000/9000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 640 Accepted Submission(s): 320Pro

2015-11-12 13:48:29 658

原创 prufer sequence

Prüfer sequenceFrom Wikipedia, the free encyclopedia (Redirected from Prufer sequence)In combinatorial mathematics, the Prüfer sequence (also Prüfer code or Prüfer numbers) of a label

2015-11-12 13:41:32 1397

原创 hdu 5534 Partial Tree

Partial TreeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 366 Accepted Submission(s): 204Problem DescriptionIn mathematic

2015-11-12 12:46:58 429

原创 hdu 5533 Dancing Stars on Me

Dancing Stars on MeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 348 Accepted Submission(s): 211Problem DescriptionThe sk

2015-11-12 12:30:25 683

原创 hdu5532Almost Sorted Array

Almost Sorted ArrayTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 850 Accepted Submission(s): 297Problem DescriptionWe are

2015-11-12 12:29:05 443

原创 hdu5531 Rebuild

RebuildTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 689 Accepted Submission(s): 151Problem DescriptionArchaeologists fin

2015-11-12 12:23:52 741

原创 hdu5528 Count a * b

Count a * bTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 262 Accepted Submission(s): 132Problem DescriptionMarry likes to

2015-11-12 12:18:34 1026

原创 hdu5527Too Rich

Too RichTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)Total Submission(s): 401 Accepted Submission(s): 119Problem DescriptionYou are a rich pe

2015-11-12 11:51:33 856

转载【数论】【逆元】【O(n)时间求出1~n对模MOD的逆元】

http://www.2cto.com/kf/201401/272375.html新学的一个求逆元的方法：inv[i] = ( MOD - MOD / i ) * inv[MOD%i] % MOD证明：设t = MOD / i , k = MOD % i则有 t * i + k == 0 % MOD有 -t * i == k % MOD两

2015-11-05 11:47:35 422

LJQ