随笔分类 - 数学------------
摘要：Dying Light Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 513 Accepted Submission(s): 122 Pro
阅读全文
摘要：Pokémon GO Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 171 Accepted Submission(s): 104 Proble
阅读全文
摘要：A - K-City Time limit : 2sec / Memory limit : 256MB Score : 100 points Problem Statement In K-city, there are n streets running east-west, and m stree
阅读全文
摘要：A. The Useless Toy time limit per test：1 second memory limit per test：256 megabytes input：standard input output：standard output A. The Useless Toy tim
阅读全文
摘要：Add More Zero Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 398 Accepted Submission(s): 283 S
阅读全文
摘要：A. Saitama Destroys Hotel time limit per test：1 second memory limit per test：256 megabytes input：standard input output：standard output Saitama acciden
阅读全文
摘要：#1498 : Diligent Robots 时间限制:10000ms 单点时限:1000ms 内存限制:256MB 描述 There are N jobs to be finished. It takes a robot 1 hour to finish one job. At the begi
阅读全文
摘要：原题： Solve the equation: p*e-x + q*sin(x) + r*cos(x) + s*tan(x) + t*x2 + u = 0 where 0 <= x <= 1. Input Input consists of multiple test cases and termi
阅读全文
摘要：题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2456 题意 输入两个整数a和b，输出从a到b（包含a和b）的平方数的个数。直到输入0 0时程序
阅读全文
摘要：快速傅里叶变换（Fast Fourier Transform）是信号处理与数据分析领域里最重要的算法之一。我打开一本老旧的算法书，欣赏了JW Cooley 和 John Tukey 在1965年的文章中，以看似简单的计算技巧来讲解这个东西。 本文的目标是，深入Cooley-Tukey FFT 算法，
阅读全文
摘要：C. Do you want a date? time limit per test：2 seconds memory limit per test：256 megabytes input：standard input output：standard output Leha decided to m
阅读全文