《算法艺术与程序设计竞赛》第四章习题-D题

最新推荐文章于 2024-09-10 01:01:32 发布

泉皋

最新推荐文章于 2024-09-10 01:01:32 发布

阅读量824

点赞数

分类专栏： OJ 文章标签： c++ acm oj 算法 hash

本文链接：https://blog.csdn.net/kamen_/article/details/21194687

版权

这篇博客介绍了如何利用哈希解决算法问题，即从两个整数列表中找到和为10000的两个数。作者指出，这种方法简单直接，并对比了使用二分法的复杂性。此外，博主还分享了通过题目提示了解到scanf的效率高于cin的知识，并对在线评测系统(OJ)的稳定性进行了吐槽。

摘要由CSDN通过智能技术生成

— The Brother of mine, the Head of Monastic Order wants to know tomorrow about the results long-term researches. He wants to see neither more nor less than the Summering Machine! Even moreover, he wants our Machine — only a machine — to demonstrate its comprehension of the Sacrament of the Sum as deeply as it is possible. He wants our Machine to find two numbers that give the sum equal to the Sacred Number 10 000.
— Tsh-sh-sh! This is madness that borders on blasphemy! How can the Machine calculate the Sacred Number? Twenty seven years we work on it, but we've could teach it to tell if the sum of two introduced numbers greater or lower than 10 000. Can an ordinary mortal find two numbers that there sum will be equal to 10 000?
— But we'll have to do it with the help of our Machine, even if it is not capable. Otherwise we'll have... let's say, big problems, if it is possible to call