How fast is the Z-trening grader?
Speed
PIII @ 1.6Ghz
Actually, some of the grading servers run inside a virtual machine on a lot more powerful computers.
However, due to backward compatibility, they simulate slower computers. Currently, there are 4 graders that are actually 1.6 Ghz (but are not used, since I'll be using them for something else), and there is a 2xQuad core @3Ghz that runs 4 virtual graders, each simulating 1.6 Ghz machine.
However, due to backward compatibility, they simulate slower computers. Currently, there are 4 graders that are actually 1.6 Ghz (but are not used, since I'll be using them for something else), and there is a 2xQuad core @3Ghz that runs 4 virtual graders, each simulating 1.6 Ghz machine.
So, Core2Quad simulate 1.6 PIII... How did you do that?
And I guess that you know how much different are PIII and Core2 architecture?
And I guess that you know how much different are PIII and Core2 architecture?
i run virtual machines
are there differences for different languages or the time limit stays the same?
Yes there are differences. For pascal, c, c++ it's the same. I know that Java has some different coefficient. I know that and the other programming languages had different coefficients, but i don't remember exactly how much were they.
well its soo not fail for pascal and c to have the same time limit...pascal reads slowly and does some operations slower than c&c++
That is why there is GPC- GNU Pascal. You can use that. It is much faster then free pascal, it is almost as c++
well yea:D
Adjust the measurement speed of the Pascal.
For most tasks, with written in Pascal, is about two times slower than C++, though it comes to the same algorithm. For some tasks can't load data at a given time limit (z-which, maxsum). The last task that I have done, "Plahte", the time in C++ is 1.44 ms, in Pascal 3.47 ms, although it is encoded by the same algorithm.
For most tasks, with written in Pascal, is about two times slower than C++, though it comes to the same algorithm. For some tasks can't load data at a given time limit (z-which, maxsum). The last task that I have done, "Plahte", the time in C++ is 1.44 ms, in Pascal 3.47 ms, although it is encoded by the same algorithm.
I know that Pascal is 2 or 3 times slower than c++, but the measurement speed of Pascal will remain the same. The only thing that can be done is the time limit which is set for the tasks to be appropriate for Pascal.
PS: z-which can be solved in pascal.
PS: z-which can be solved in pascal.
You're right for different times (I am not well formulated sentences); set different time limits for certain languages. For z-which I know. I did it first in Pascal, but the time passed after a series of successive posts of the same code.