Just post the task name here.
Request Your task to be accepted
mobitel: please format the task according to z-training formatting standards
it's explained here:
http://www.z-trening.com/new/www/html/static.php?page=mytask_texts
http://www.z-trening.com/new/www/html/static.php?page=mytask_texts
please follow the instructions on the task text formatting!
Also, if you have your own, interesting problems, don't ask me for publishing them, but instead let me know, and I will use them for the competitions - and you will get 100 points on them - since you are the authors!
Also, if you have your own, interesting problems, don't ask me for publishing them, but instead let me know, and I will use them for the competitions - and you will get 100 points on them - since you are the authors!
If you don't know all user tasks should have english version of text. Maybe this is reason admin isn't approving your tasks.
I'm publishing the tasks after they've been reviewed by the moderators.
Allow moderators some time to review your tasks.
Thank you,
Allow moderators some time to review your tasks.
Thank you,
Stupovi
@dario-dsa: it's not point to put here all tasks you did ... just imagine what would be if everyone put here tasks they solved ... :D
The bigger problem is that they are tooo easy...^^ (except Sails , and ....don't know more :D )
if dario-dsa wants to add tasks to z-trening, and users don't want the tasks to be easy, i suggest for dario to post tasks from competitions harder then COCI, like IOI, BOI CEOI, ACM
Well another problem cuz dario sets some tasks he didn't solved and he just submits the official solution... And you guys are right there should be some more challenging tasks...
Setting up a task, and submitting the official solution is totally fine (that is actually a good way to test whether the task was set correctly)
I agree that the tasks are too easy.
I just wanted to thank Dario (since everyone is kind of mean to him). Dario actually uploaded a lot of tasks, and I like that. So thank you Dario.
However, please try to upload harder tasks, and try to format them nicely! Preview the tasks and make sure that the text is formatted well - no extra line breaks, spaces, etc.. etc... This will make the moderator's life a lot easier, and your tasks will be published a lot faster!
Also, please make sure you upload the official test data, or if it's not available, then make sure you create good tests!
I see that the IOI 2009 tasks have been published online (with the official solutions and the test data), It would be great if someone uploaded these.
Thanks
I agree that the tasks are too easy.
I just wanted to thank Dario (since everyone is kind of mean to him). Dario actually uploaded a lot of tasks, and I like that. So thank you Dario.
However, please try to upload harder tasks, and try to format them nicely! Preview the tasks and make sure that the text is formatted well - no extra line breaks, spaces, etc.. etc... This will make the moderator's life a lot easier, and your tasks will be published a lot faster!
Also, please make sure you upload the official test data, or if it's not available, then make sure you create good tests!
I see that the IOI 2009 tasks have been published online (with the official solutions and the test data), It would be great if someone uploaded these.
Thanks
Admin can I be a moderator?
Izbori
Klonovi
Nizovi
Cvjetići and Arhitekt
hmm, tnx Dario, it works :P
np(moderator or admin erase the task Faktori)
Erasing a task is not possible for moderators. However, you dont have to erase it, when you upload a task the next time, just use the one you created already,overwrite it.
@dario_dsa:
Can you please make time limit for lubenica to 2 or 3 seconds ? Its really hard to make it under 1 sec...
Can you please make time limit for lubenica to 2 or 3 seconds ? Its really hard to make it under 1 sec...
I agree Amtrix :)
The official time limit for Lubenica set by COCI is 3 seconds. The time limit for this task will be changed, of course. It was a mistake by the author who set it like this, and a mistake by the moderator who published it without comparing the task at COCI.
It is possible to increase the time limit even more because at COCI they used a 2.66 GHz processor, and a single grader here on z-trening is running on much slower processor.
Just notify me if there are other mistakes like this.
It is possible to increase the time limit even more because at COCI they used a 2.66 GHz processor, and a single grader here on z-trening is running on much slower processor.
Just notify me if there are other mistakes like this.
sorry.Kratica
I notice a tendency to so set both time and memory limits very tight, mostly based on the 'standard' solution. But is there a reason for that? I thought that this is a training site, not a competition site, so why not set both limits to their maximum values, unless there's a good reason for it? Of course this will allow sub-optimal solutions to get accepted, but is that bad? If someone is not satisfied with his solution's performance, he can always try to re-write it. I think that's better suitable for a training site, where people come to learn, than just rudely rejecting all codes that are not tweaked for maximum performance.
Just my opinion.
Just my opinion.
Izraz
need a English version
@crusader:
well, I agree with you. Now we pay more attention to these limits. I hope z-trening can be a better place for all of us to improve our skills in programming. Thanks for your input and happy coding.
For the tasks which is not published
We will set the limits 1/3 or 2/3 more from the intended solutions, except for tasks from other competitions, such as COCI(we will use the original limits).
For the tasks which is published
You can help us by making a list for tasks which have a very strict limit. We will change it if possible. Thanks for your co-operation.
well, I agree with you. Now we pay more attention to these limits. I hope z-trening can be a better place for all of us to improve our skills in programming. Thanks for your input and happy coding.
For the tasks which is not published
We will set the limits 1/3 or 2/3 more from the intended solutions, except for tasks from other competitions, such as COCI(we will use the original limits).
For the tasks which is published
You can help us by making a list for tasks which have a very strict limit. We will change it if possible. Thanks for your co-operation.
@crusader
Well,there are training tasks and competition tasks. For the training tasks the time limit can be set to 20 secs, and memory limit to 1 GB, this is not very important. But for the tasks that were used in the competitions, the goal is the best algorithms to get most points,and the worse algorithms to get less points, so after the competition when they are moved to training section, it is intended those limits to stay the same, so that while you are practicing, to see how much points will you get like you are really on the competition.
But you are probably asking for tasks that have insane extreme limits.It may happen this limits to be changed if the task is too hard to solve within those limits. Can you name some of the tasks which you think have too tight limits?
Well,there are training tasks and competition tasks. For the training tasks the time limit can be set to 20 secs, and memory limit to 1 GB, this is not very important. But for the tasks that were used in the competitions, the goal is the best algorithms to get most points,and the worse algorithms to get less points, so after the competition when they are moved to training section, it is intended those limits to stay the same, so that while you are practicing, to see how much points will you get like you are really on the competition.
But you are probably asking for tasks that have insane extreme limits.It may happen this limits to be changed if the task is too hard to solve within those limits. Can you name some of the tasks which you think have too tight limits?
I wasn't aware of the distinction between training tasks and competition tasks. I suppose the problems flowing in from (mainly) the COCI site are in the latter category and should have those limits. I was reading the above comments and remembering my own experience with some problems, and just wondered why there should be limits at all. But you explained that.
I can't recall individual cases from the back of my head, but I'll report them when I encounter them.
In general, however, I think 0.1 seconds is too tight for a problem that needs some processing; the time is measured in units of 0.015 seconds with a substantial margin of error, and the difference between getting AC and TLE is only the difference between 6 and 7 'clock ticks'. See f.i. problem "Simple Math", where a great number of solutions spend 6 ticks (i.e. 0.09 seconds) on some test cases. I really see no harm in setting the time limit for this problem to any bigger value.
I can't recall individual cases from the back of my head, but I'll report them when I encounter them.
In general, however, I think 0.1 seconds is too tight for a problem that needs some processing; the time is measured in units of 0.015 seconds with a substantial margin of error, and the difference between getting AC and TLE is only the difference between 6 and 7 'clock ticks'. See f.i. problem "Simple Math", where a great number of solutions spend 6 ticks (i.e. 0.09 seconds) on some test cases. I really see no harm in setting the time limit for this problem to any bigger value.
Problem Kruska: to solve it, you need to store over one million states, each consisting of an int and a long long.
You can use two separate arrays and consume over 12 Meg of memory, or you can use an array of records, each with an int and a long long (the method I prefer). In the latter case, however, the compiler reserves 16 bytes of memory for each record, not 12, which means that 16 Megs of memory is not enough (you need to store some other data too).
I think this is a typical case where the memory limit is based on the standard solution, while it's completely irrelevant for the problem if it were set to maximum.
BTW: as a matter of fact, the lime limit is irrelevant for this problem too: either you find the correct algo and solve it within say 0.1 seconds per case, or you don't and your code will spend hours on the tougher cases.
You can use two separate arrays and consume over 12 Meg of memory, or you can use an array of records, each with an int and a long long (the method I prefer). In the latter case, however, the compiler reserves 16 bytes of memory for each record, not 12, which means that 16 Megs of memory is not enough (you need to store some other data too).
I think this is a typical case where the memory limit is based on the standard solution, while it's completely irrelevant for the problem if it were set to maximum.
BTW: as a matter of fact, the lime limit is irrelevant for this problem too: either you find the correct algo and solve it within say 0.1 seconds per case, or you don't and your code will spend hours on the tougher cases.
@crusader: thanks for your input. I have set it to original limit.
If time and memory limit of some tasks on z-trening are not same as the official limits, it will be fixed.
Great!
admin you can use a z-radnik and z-skijanje for competition
@crusader http://www.z-trening.com/forum.php?show_board=10002&ref_id=10002&view_topic=112287
@dario: yes, thank you
z-autobus for competition too
I repeat my request to the publication of my task "Iodine".
Please, my task sio-zvrkovi?
@didins just add after output [/ex] and It will be only one [p] and [/p].Your task and the others is OK.
Done.
z-profesor for competition
@pyost
Maybe I'll use the task BrainF for a competition.
Maybe I'll use the task BrainF for a competition.
I deleted it from this topic because the tests need some more tweeking, so I'll do that first.
Could you publish my task "Rearranging Digits"? You can use it for competition if you want.
z-dsa for competition
How can I make my task public? I've uploaded it, the text, test cases, checker ... but it isn't in the z-trening tasks?
Write the name of the task here in this topic. Only moderators can publish tasks.
And if you're asking about the task "Lavirint", it can not be published. All tasks must have english language.
And if you're asking about the task "Lavirint", it can not be published. All tasks must have english language.
Dobra stara vremena
@kkosor
Dobra stara vremena- the task description isn't formatted. Use [in] [/in] [out][/out] [ex][/ex] etc.
Dobra stara vremena- the task description isn't formatted. Use [in] [/in] [out][/out] [ex][/ex] etc.
z-loto and z-bum for competition
I fixed your task and I am published.Continue the adding tasks.
Some of the recent additions are terrible: very poor English, bad descriptions, under-specified I/O, and/or extremely simple. Could any of the 'real' admins look at them before they get published?
This is not the way to reach 750, IMO, if you want your site to be taken serious.
This is not the way to reach 750, IMO, if you want your site to be taken serious.
I am very sorry cause that and it won't happen again and want see the new page of Z-trening.
Can someone from Croatia add tasks from your "Zupanijsko" and "Drzavno" competition because I can't find them anywhere . Thanks in advance . :)
www.natjecanje.fesb.hr
http://www.info-kup.com.hr/ -> DMIH
@aleksndar msn
Guys, please use English on this forum.
I've created a task and I'm it author. Its id is 5000000452. May be you want to use its in a competition. If you want the source code just tell me an email address to send the code to you. BTW, please inform me when you confirmed it.
I want to publish a task named "Help in organizing"
I think its now ok with this task.
but, there is a problem, I changed test cases and submitted a solution.
The grader gives the same result before changing the test case and also on deleting all test cases and adding 2 test cases and leaving 50 testcase entries empty.
This program is submitted also on spoj.pl and it works.
I want to publish it.
Thanks a lot in advance.
but, there is a problem, I changed test cases and submitted a solution.
The grader gives the same result before changing the test case and also on deleting all test cases and adding 2 test cases and leaving 50 testcase entries empty.
This program is submitted also on spoj.pl and it works.
I want to publish it.
Thanks a lot in advance.
The 52 testcases are uploaded for "Help in Organizing"
@ Emil
Please be patient. I am rather busy now until next week.
Please be patient. I am rather busy now until next week.
Nevermind. Take your time.
@ Emil
seems to me, that solution and task statement is now good,
but still some problems exist in solution format.
for some reason, all Your output files which You uploaded as test cases are not same format. For Example TC 1, 2, 5, 6, are different then 3,4,7. In last three You have some control character but in first 4 not.
I don't really know which character is it, but for 3,4,7 test case, my code work well but for 1,2,5 and 6 no, even solution is same as Your. I believe that this can cause lot of trouble for other on Z-training.
So I will rearrange Your input and output files on TC, because in Java and Pascal separately problem is same
In future, try to create same format for all txt files with input and output.
When You read this, just replay then I will remove this topics.
I believe Task will be published before You read this.
seems to me, that solution and task statement is now good,
but still some problems exist in solution format.
for some reason, all Your output files which You uploaded as test cases are not same format. For Example TC 1, 2, 5, 6, are different then 3,4,7. In last three You have some control character but in first 4 not.
I don't really know which character is it, but for 3,4,7 test case, my code work well but for 1,2,5 and 6 no, even solution is same as Your. I believe that this can cause lot of trouble for other on Z-training.
So I will rearrange Your input and output files on TC, because in Java and Pascal separately problem is same
In future, try to create same format for all txt files with input and output.
When You read this, just replay then I will remove this topics.
I believe Task will be published before You read this.
@ Emil
Mr. Emil,
I still can not publish Your task. I wait for Your permission.
TC number 8,9,29,30,31 and 51 from previous set, are not matches with my solution. It is possible that I am wrong but since second example from task statement, which is:
89
6
is good, i believe that You miscalculate solution in this 6 cases because TC#51 was:
87
7
and You must agree that this is not possible, if 89, 6 is Good.
So I decide to remove this 6 TC, and now with 46 Test Cases, I think task is ready.
Mr. Emil,
I still can not publish Your task. I wait for Your permission.
TC number 8,9,29,30,31 and 51 from previous set, are not matches with my solution. It is possible that I am wrong but since second example from task statement, which is:
89
6
is good, i believe that You miscalculate solution in this 6 cases because TC#51 was:
87
7
and You must agree that this is not possible, if 89, 6 is Good.
So I decide to remove this 6 TC, and now with 46 Test Cases, I think task is ready.
English
@oduleodule
Mr. oduleodule,
I have just update test cases.
Thanks a lot.
Mr. oduleodule,
I have just update test cases.
Thanks a lot.
Mr. Emil,
I can not publish this task because my codes don't match Your test cases now. (lot of them are mismatched)
You must wait for some other moderator to solve this task, or try to explain me what is The algorithm.
Use oodule [at] gmail [dot] com for further communications.
Regards,
I can not publish this task because my codes don't match Your test cases now. (lot of them are mismatched)
You must wait for some other moderator to solve this task, or try to explain me what is The algorithm.
Use oodule [at] gmail [dot] com for further communications.
Regards,
Cudan niz
Gospon Lovro, Ako prvi član nema masu, zašto bi N-ti imao.
Ako ipak ima, sta da se radi ako je N+1-vi nroj prost?
Tada ima malo zabune, nije jasno može li desni sused N-tog člana biti prost, s obzirom da su svi prosti već ranije poslagani.
Da ti to ne kvari test primera, možda je rešenje da se nakon pripreme konačnog poretka, sa desne strane dopiše N+1.
Ako ipak ima, sta da se radi ako je N+1-vi nroj prost?
Tada ima malo zabune, nije jasno može li desni sused N-tog člana biti prost, s obzirom da su svi prosti već ranije poslagani.
Da ti to ne kvari test primera, možda je rešenje da se nakon pripreme konačnog poretka, sa desne strane dopiše N+1.
http://www.z-trening.com/forum.php?show_board=10002&ref_id=10002&view_topic=112832
Hello, I have uploaded new task called Emirp (with test and checker ofc). I have tested it also and all tests are working as they should. Please check it and make it public if all is ok with it. If not please tell me what I need to correct... Thank you in advance... :)
Divide factorials
Metro
Hi,
Task name : Bears
http://z-trening.com/tasks.php?show_task=5000001845
Task name : Bears
http://z-trening.com/tasks.php?show_task=5000001845
monitor
http://z-trening.com/tasks.php?show_task=5000001858&lang=rs
http://z-trening.com/tasks.php?show_task=5000001858&lang=rs
I need test case No2 inputs in Gljive-coci . Pls publish it
http://hsin.hr/coci/archive/2010_2011/contest5_testdata.zip
Task: z-impossible