洛谷 AT_abc228_d [ABC228D] Linear Probing 题解 (AtCoder)
题目原题首先我们读题目,会知道问题在于如何快速解决操作1x。暴力直接按照题目的意思,用while循环去枚举,当h\texttt{h}h满足ah mod n=−1a_{h\bmodn}=-1ahmodn=−1时,令ah mod n=xa_{h\bmodn}=xahmodn=x.但是显然会超时的#include#include#include#include#include#definelllongl