![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
卡常数
codertcm
这个作者很懒,什么都没留下…
展开
-
Halting Problem
In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program, whether the program will finish running (i.e., halt) or continue to run...原创 2018-09-16 19:09:41 · 181 阅读 · 0 评论 -
C++ Interesting卡常数
IO优化 fread 和 fwrite ,如果还想再优化有mmap....(然而并不会用,好像也没用。。。) 读入优化(这个非常重要!!!!!!!) inline int Read(){ int x=0,f=1;char c=getchar(); while(c>'9'||c<'0') {if(c=='-') f=-1;c=getchar();} w...转载 2018-09-16 19:15:43 · 231 阅读 · 0 评论