摘要:
Monkey and Banana Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2599 Accepted Submission(s): 13 阅读全文
摘要:
hdu 1087 Super Jumping! Jumping! Jumping!(动态规划DP) 题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1087 Super Jumping! Jumping! Jumping! Time Limit: 200 阅读全文
摘要:
A * B Problem Plus 链接:http://acm.hdu.edu.cn/showproblem.php?pid=1402 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)T 阅读全文
摘要:
转载自: http://cubercsl.cn/note/FFT/ 简介 快速傅里叶变换(FFT) 什么是FFT?FFT(fast Fourier transform)是用来计算离散傅里叶变换(discrete Fourier transform,FFT)及其逆变换(IDFT)的快速算法。如果没有数 阅读全文