DeaphetS

摘要： 622A - Infinite Sequence 20171123 暴力枚举\(n\)在哪个区间即可，时间复杂度为\(O(\sqrt{n})\) #include<stdlib.h> #include<stdio.h> #include<math.h> #include<cstring> #incl 阅读全文

摘要： 620A - Professor GukiZ's Robot 20171122 \(ans=max(\left | x2-x1 \right |,\left | y2-y1 \right |)\) #include<stdlib.h> #include<stdio.h> #include<math. 阅读全文