Do the students of the Chinese University of Science and Technology dare not face anything more?

. According to his self-claim, he sent this article to "Beat" my face ". Next, let's see how he" slapped his face.

I have analyzed a beginner's question about the following:

.

When an integer X is displayed on the screen", Kindergarten children can understand the conditions, but he has to pretend to be stupid. You are a second-year graduate student. Can you even understand the problems that second-year students can understand? It's nothing more than finding the correct one.

This question should not be calculated in advance and then searched by binary"Isn't that an asshole? In your sentence, This question"What does it mean? It doesn't matter if you make a mistake. Previously, I assume that this question needs to be answered multiple times."Is this kind of lie concealed without being split? What's more, "Answer multiple times", are you confused about writing this code? My reply at the time was:

.

Inertia Calculation Matrix", Do you want to learn the terms that only you can understand when you create these strange terms? The shit blog post I quoted later won't even be able to write anything with my feet. Do you mean to make a fortune here? What is "compared to the original mass Table Generation Method"? Isn't your screening method primitive? The Rabin-Miller method is not original? However, at that time, I was still patient and replied:

 

Therefore, when the prime number is very sparse, it is inevitable that a lot of data will be computed.." It is based on the logic conclusion of shit. Politely speaking, the level is too low. Bluntly speaking, it is to say that the strong words are justified. For" ." It's just nonsense. Do you still use it? Isn't my algorithm just to avoid the huge cost of calculating the prime number table? Logically, this is also a shit different, because since I mentioned my algorithm" ", Shouldn't your method be demonstrated later?" ? Have you demonstrated this? " "Does not require" computing a lot of data? Your method must calculate more data before "yes". Why do you choose not to turn a blind eye to it?

There is a rough analysis. Even if it is your method, changing the number table of the inert EPO into the number table of the EPO is also a way to simplify the problem and improve efficiency.

".

 

There are two modes for this question, One is to consider only one question and answer,The other is to consider continuous Q &.

In fact, I think your solution is not good, it increases unnecessary complexity, and it has not better solved the problem.? It's not a big comment.." ? How can I start to face myself?

"""Isn't it an asshole?

Is a prime number determination rule. It uses the randomization algorithm to determine whether a number is a combination orPossibleIs a prime number.

Any given accuracyGivenPossibleThe correct answer. When the accuracy is large enough, we can almost think that the answer provided by this algorithm is correct. (This was ridiculed by GarbageMan. I guess he doesn't know why the reciprocal of infinity is 0.)

In the case of multiple questions and answers

Get_nearestMethod. Large number of questions and answersThis method is even faster than the Algorithm Optimized by GarbageMan.

Large number of questions and answers"In""You will understand how big it is.

 

 

Comparison in single Q & A Mode, The algorithm used by GarbageMan and the Rabin-Miller algorithm; in the Multi-Q & A mode, the algorithm used by GarbageMan and other algorithms are used. In the multiple Q & A mode, you need to fine-tune the algorithm used by GarbageMan to ensure the fairness and correctness of the test:

", But pretend to be" fair ". How many tons of fake and hypocritical packages are required ?!

/STACK: 10485760,1048576/O2

-O2-std = c ++ 11.

"""Lie. In addition, I used my C code as C ++ code compilation, and "combined with boost Library", all of which were cheating in the dark. This is the "fairness" of his voice ".

Elapsed: 3900005 ms // GarbageMan method Elapsed: 500001 ms // positive calculation method Elapsed: 2890109 ms // Rabin-Miller algorithm Elapsed: 270015 ms // prime screening method and Binary Search

Elapsed: 3920017 ms // GarbageMan method Elapsed: 500001 ms // positive calculation method Elapsed: 2800004 ms // Rabin-Miller algorithm Elapsed: 300001 ms // prime screening method and Binary Search

It can be seen that GarbageMan's algorithm runs less efficiently on average and is less efficient than the positive calculation method. It can be seen that not only has the white optimization but also has a negative effect.

In the multi-Q & A mode, GarbageMan's algorithm is still less efficient than the Rabin-Miller algorithm designed for the single Q & A mode."Is this sentence mysterious? In the"In any case, my algorithms suffer, because my algorithms are originally designed for a single Q &. ""Will completely eliminate the advantages of my algorithms. However, the Rabin-Miller algorithm is not affected by the single mode or multiple modes. He deliberately made this difficult sentence to avoid publishing the results of my calculations and the Rabin-Miller Algorithm in a single Q & A mode. Then, the "Law of big numbers" that were deliberately created and unrelated to man's inaccessibility was used to reveal his elaborate lie.

Comparison in single Q & A Mode", But to announce the results, I had to eat it myself. Shame!

50,000? Remember the""" It will be several steps faster than your algorithm.? Why should he10000"Random number to"50,000? The reason is simple. It takes a lot of time to generate a prime number table within 109. To "prove" His method is fast and he wants to use "facts" to fabricate a lie, this huge time cost needs to be apportioned. This is one of the reasons.

BarrierGarbageMan's introduction to a hyper-complex recursion-experiment and thinking about latency computing. We can't help wondering, what did he say?

", Experience tells me that excellent programmers are very sensitive to typos and generally do not write typos. Another example is the definition of prime numbers:

, Also known as prime number, refers to a positive integer that cannot be divisible by other positive integers except 1 and itself.