Just post the name of the task or tasks and they will be fix.
Task with bug
parovi and obilazak have input bug, i think some input cases are missing...
Should we report here too if we find a task with weak test cases ?
( examples: z-pumpe , Data Encrypftion , BubbleLock )
Some solutions shouldnt get AC ....
( examples: z-pumpe , Data Encrypftion , BubbleLock )
Some solutions shouldnt get AC ....
something is wrong with task ulice, the moderators have tried testing my solution manually, and it's correct. however, the judge gives wa on all cases.
Шта овде не ваља?
http://z-trening.com/submit.php?submit=7100125250&subm_code=1
http://z-trening.com/submit.php?submit=7100125250&subm_code=1
Task "kamen" has link for Serbian translation but there is no any text.
Admin need fix that.In Serbian version doesn't work format.Task have Croatia version(??) is the same.
It is not the same it is similarly but not the same!!!
matteo msn
I have Serbian version of task kamen(č and ć is ?)
Mali Ðurica je našao N kamen?i?a. Na svakom kamen?i?u je napisano jedno veliko slovo engleske abecede (slova od 'A' do 'Z'). On je izmerio svaki kamen?i? i utvrdio njegovu masu u gramima. Nakon toga je napisao re? dužine M koja se sastoji samo od velikih slova engleske abecede. Malog Ðuricu zanima koja je najmanja masa kamen?i?a, koje treba da izabere, tako da kad ih nekako složi u jedan red dobije prethodno napisanu re?.
Pošto mali Ðurica želi da se igra, ovaj problem je prepustio Vama.
Ulaz:
(Ulazni podaci se Ucitavaju sa standardnog ulaza) U prvom redu se nalaze celi brojevi N (1 ? N ? 50000) i M (1 ? M ? 50000). U narednih N redova se nalaze po jedno slovo si i jedan ceo broj ti, gde si predstavlja slovo na i-tom kamen?i?u (si ?e uvek biti veliko slovo engleske abecede), a ti (1 ? t[i] ? 50000) masu i-tog kamen?i?a. Potom se u?itava M redova koji sadrže po jedno slovo i to su redom slova re?i koju je napisao mali Djurica.
Izlaz:
(Izlazne podatke upisati u datoteku kamen.out) U prvom redu datoteke ispisati najmanju ukupnu masu kamen?i?a koje je potrebno koristiti da bi se njihovim slaganjem dobila napisana re?. Ako je nemogu?e dobiti napisanu re? ispisati -1.
Ogranicenja:
* 1 ? N ? 50000
* 1 ? M ? 50000
* 1 ? ti ? 50000
* 'A' ? s[i] ? 'Z'
Primeri:
Ulaz:
5 3
A 10
B 40
C 30
B 20
E 50
C
E
B
Izlaz:
100
Ulaz:
14 11
A 1
I 2
K 3
L 4
O 5
P 6
N 7
F 8
R 9
O 10
M 11
T 12
I 13
Z 14
I
N
F
O
R
M
A
T
I
K
A
Izlaz:
-1
I have Serbian version of task kamen(č and ć is ?)
Mali Ðurica je našao N kamen?i?a. Na svakom kamen?i?u je napisano jedno veliko slovo engleske abecede (slova od 'A' do 'Z'). On je izmerio svaki kamen?i? i utvrdio njegovu masu u gramima. Nakon toga je napisao re? dužine M koja se sastoji samo od velikih slova engleske abecede. Malog Ðuricu zanima koja je najmanja masa kamen?i?a, koje treba da izabere, tako da kad ih nekako složi u jedan red dobije prethodno napisanu re?.
Pošto mali Ðurica želi da se igra, ovaj problem je prepustio Vama.
Ulaz:
(Ulazni podaci se Ucitavaju sa standardnog ulaza) U prvom redu se nalaze celi brojevi N (1 ? N ? 50000) i M (1 ? M ? 50000). U narednih N redova se nalaze po jedno slovo si i jedan ceo broj ti, gde si predstavlja slovo na i-tom kamen?i?u (si ?e uvek biti veliko slovo engleske abecede), a ti (1 ? t[i] ? 50000) masu i-tog kamen?i?a. Potom se u?itava M redova koji sadrže po jedno slovo i to su redom slova re?i koju je napisao mali Djurica.
Izlaz:
(Izlazne podatke upisati u datoteku kamen.out) U prvom redu datoteke ispisati najmanju ukupnu masu kamen?i?a koje je potrebno koristiti da bi se njihovim slaganjem dobila napisana re?. Ako je nemogu?e dobiti napisanu re? ispisati -1.
Ogranicenja:
* 1 ? N ? 50000
* 1 ? M ? 50000
* 1 ? ti ? 50000
* 'A' ? s[i] ? 'Z'
Primeri:
Ulaz:
5 3
A 10
B 40
C 30
B 20
E 50
C
E
B
Izlaz:
100
Ulaz:
14 11
A 1
I 2
K 3
L 4
O 5
P 6
N 7
F 8
R 9
O 10
M 11
T 12
I 13
Z 14
I
N
F
O
R
M
A
T
I
K
A
Izlaz:
-1
agenti
Upper bound for N is wrong.
It says 1 < N <= 3500, but in last test case, N > 3500
Upper bound for N is wrong.
It says 1 < N <= 3500, but in last test case, N > 3500
z-tackice, there is a link for English translation, but there is not such translation.
У задатку mit-indiv09-words постоји грешка у ограничењима за променљиву А...
DSA-profesor has bug or test cases are bad.
http://www.z-trening.com/submit.php?subm_stat=1&submit=7100137337
http://www.z-trening.com/submit.php?subm_stat=1&submit=7100137337
Nevenka:
In some cases the input contains less edges than given. In the 4th case there should be 555 edges, but the input only contains 554.
In some cases the input contains less edges than given. In the 4th case there should be 555 edges, but the input only contains 554.
Something is wrong with task z-trees. The judge says 'system error', I guess that has nothing to do with my code? Or am I wrong?
edit: I've submitted a program that only prints 0, it also gets system error, so someone please fix this! :)
edit: I've submitted a program that only prints 0, it also gets system error, so someone please fix this! :)
DSA-KimVerson , very bad translation . :(
this task is NP-complete btw:)
You mean NP-complete?
yes, sorry my english knowledge is not very good
fixed:)
fixed:)
No problem, I just corrected you so people don't get confused :)
This problem is a complete mess. The statement is very bad, as noted above, the sample input is corrupt, the sample output is wrong, the test cases are way too simple (they contain either 1 or 2 'K's) and the 'official' solution is wrong for more complicated tests.
When will the admins stop this idiot from doing more damage to this site?
When will the admins stop this idiot from doing more damage to this site?
He is not an idiot he just doesn't know English but I think that he can post other tasks here on z-trening, but not his tasks because they aren't good!!!
Unfortunately, i can't do much about this. The only thing you can do is not solve his tasks.
Let me consult with the rest of the moderators, to figure out what to do.
ok task DSA-Kim is the worst task ever published here...really why doesnt dario publish task operacije from serbian national i translated it and sent it to his email?
You can add because I am busy with school.
@MilosRadic:
Please update the tasks to z-training, and then ask the moderators to publish it.
@All:
Dario was very impatient to see the new website, and started publishing a lot of tasks that were not prepared well, or were too easy for z-training.
However Dario has uploaded a lot of good tasks as well. We have agreed that Dario will be a lot more careful next time he publishes a task.
In the spirit of the World Cup, we can say that Dario got a yellow card :) So please, don't blame dario any more, and let's work together to make the tasks better.
As we have got now more than 750 Tasks, it is time for the big update.
I will start replacing the website partially starting from next weekend (in 7 days), and hopefully the update will not last more than a week.
However, be ready for new bugs :)
Please update the tasks to z-training, and then ask the moderators to publish it.
@All:
Dario was very impatient to see the new website, and started publishing a lot of tasks that were not prepared well, or were too easy for z-training.
However Dario has uploaded a lot of good tasks as well. We have agreed that Dario will be a lot more careful next time he publishes a task.
In the spirit of the World Cup, we can say that Dario got a yellow card :) So please, don't blame dario any more, and let's work together to make the tasks better.
As we have got now more than 750 Tasks, it is time for the big update.
I will start replacing the website partially starting from next weekend (in 7 days), and hopefully the update will not last more than a week.
However, be ready for new bugs :)
z-hacker2
The flash graph tells that only 4 people have solved the task, but as i can see 14 people have solved the task.
The flash graph tells that only 4 people have solved the task, but as i can see 14 people have solved the task.
Task 'Debug'
It seems to me that the test 5 and 7 are incorrect. In test 5 in the 20 line is missing a character, in test 7 the last two rows. Please, check.
It seems to me that the test 5 and 7 are incorrect. In test 5 in the 20 line is missing a character, in test 7 the last two rows. Please, check.
Dario has corrected the fifth case. In case 7 add two rows or first line should be 95 100, not 97 100.
Task BubbleString.
Checker is not good or test cases. Please, check.
Checker is not good or test cases. Please, check.
@halil
I see you solved BubbleString. The checker for this task is the normal string compare. I don't think there are any problems.
What do you think, are the task,tests, checker ok ?
I see you solved BubbleString. The checker for this task is the normal string compare. I don't think there are any problems.
What do you think, are the task,tests, checker ok ?
I tried this:
and it is AC 15/15.
And limits are not correct: 'First line contains a string of uppercase English alphabet letters of length n, where 1 ≤ n ≤ 1.000.000.' In some tests n > 1.000.000
program z;
begin
writeln(0);
end.
and it is AC 15/15.
And limits are not correct: 'First line contains a string of uppercase English alphabet letters of length n, where 1 ≤ n ≤ 1.000.000.' In some tests n > 1.000.000
Task Squares2 has link for Croatin translation but no text. Please remove link or add text.
Cenzura : Checker doesn't work . You can send any code and it will pass . My code :
And it passed 10/10, with 0.00s time .
scanf ( "%d %d", &N, &M );
printf ( "%d\n", N + M );
And it passed 10/10, with 0.00s time .
STOL: I think that checher is bad
Matteo:
With official solution pass.
With official solution pass.
Come to MSN
I believe that output cases of task z-trees are missing... Please fix it.
z-ssp
CharSwap