• Welcome to the world's largest Chinese hacker forum

    Welcome to the world's largest Chinese hacker forum, our forum registration is open! You can now register for technical communication with us, this is a free and open to the world of the BBS, we founded the purpose for the study of network security, please don't release business of black/grey, or on the BBS posts, to seek help hacker if violations, we will permanently frozen your IP and account, thank you for your cooperation. Hacker attack and defense cracking or network Security

    business please click here: Creation Security  From CNHACKTEAM

Recommended Posts

一个相对简单的问题。

meet \(a _ u2aa _ ua _ VBA _ v2 \ equiv 0 \ PMO DP \)

如果\(v\)被枚举,那么\(a_u\)需要满足一个二次方程\(x ^ 2(aa _ v)\乘以x ^ ba _ v ^ 2 \ equiv 0 \ PMO DP \)。

所以你可以先解\(a_v\)对应的方程。\(p\)是一个质数,所以只能有两个解。

然后写一个dfs序列哈希差。

复杂度\ (o (n \ log 2p) \)。

Link to comment
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now