| ENG RUS | Timus Online Judge |
Discussion of Problem 1511. Fiscal Operationsm2m let me know if there is a test case in that the any first number of A , B, C is 0 [9] // Problem 1511. Fiscal Operations 16 Dec 2006 14:06 let me know if there is a test case in that the any first number of A , B, C is 0 Please make clear that Edited by author 16.12.2006 14:06 Edited by author 16.12.2006 14:06 Edited by author 16.12.2006 14:07 Dmitry 'Diman_YES' Kovalioff No leading zeroes as usual (-) [6] // Problem 1511. Fiscal Operations 16 Dec 2006 14:36 Samsonov Alex [USU] Re: No leading zeroes as usual (-) [5] // Problem 1511. Fiscal Operations 16 Dec 2006 16:59 I'm not sure in it. When I stopped removing leading zeros, I got AC instead of WA. Probably, it's my bug, of course. Dmitry 'Diman_YES' Kovalioff We have automatic checkers for all tests and for all problems. No leading zeroes (-) [4] // Problem 1511. Fiscal Operations 16 Dec 2006 17:06 Denis Koshman Re: We have automatic checkers for all tests and for all problems. No leading zeroes (-) [3] // Problem 1511. Fiscal Operations 17 Jul 2008 21:47 According to problem statment A, B, C >= 1. Anyway, I faced a test with leading zero in input numbers (test 15). I don't know if it was just 0 or something like 0123 or even 0000 :) I removed that trap, and did not allow 0 in the very first digit of a number even if it was zero before. Got AC. Denis Re: We have automatic checkers for all tests and for all problems. No leading zeroes (-) [2] // Problem 1511. Fiscal Operations 18 Apr 2009 00:20 I've cut my check whether there are leading zeroes in all numbers and passed 15th test. What's wrong with it? Vassenbaher [IU7.BMSTU] Re: WA15 [1] // Problem 1511. Fiscal Operations 22 Aug 2010 04:11 I had problems with WA#15. The next test was useful 00001 50001 100002 Answ=5 RR Re: WA15 // Problem 1511. Fiscal Operations 7 Jan 2011 10:59 I've got accepted and my program will fail every test with input having leading zero (for example the test 00001 50001 100002 above). So in my opinion there's no leading zero in input FFFeiya Re: let me know if there is a test case in that the any first number of A , B, C is 0 // Problem 1511. Fiscal Operations 29 Jul 2018 16:34 I think #15 test is about ??0?? just like this ↓ 1 100 999 100's first '0' is the problem I can't AC because I deal with this 'carry-over' mistakenly. answer:25 maybe it can help somebody~ Vladimir Yakovlev (USU) Re: let me know if there is a test case in that the any first number of A , B, C is 0 // Problem 1511. Fiscal Operations 14 Oct 2022 01:15 Test #15 was incorrect with A=0. It is now fixed. Oracle[Lviv NU] WA#17 [1] // Problem 1511. Fiscal Operations 25 Aug 2010 19:54 This test helped me with WA#17: 5 5 1 right answer is 9 tyomitch Re: WA#17 // Problem 1511. Fiscal Operations 19 Feb 2013 18:12 Some more tests, just in case 123 554 340 >10 123 554 300 >9 23 554 300 >8 1515 1414 3424 >10 9 9 100 >-1 19 9 100 >16 1 1 18 >16 Roma Labish[Lviv NU] No subject [2] // Problem 1511. Fiscal Operations 16 Dec 2006 16:26 May number C has more digest, then numbers A and B? Dmitry 'Diman_YES' Kovalioff Yes (-) [1] // Problem 1511. Fiscal Operations 16 Dec 2006 16:27 Denis Koshman Re: Yes (-) // Problem 1511. Fiscal Operations 17 Jul 2008 21:49 Yes, but that does not cause many problems. Just prepend A and B with leading zeroes which you will never change. neoGolden algorithm [14] // Problem 1511. Fiscal Operations 21 Dec 2006 20:54 I think that answer is amount of digits |A+B-C| Sorry, it's incorrect Edited by author 03.01.2007 23:51 svr Re: algorithm [13] // Problem 1511. Fiscal Operations 24 Jan 2007 11:02 It's impossible to know all nice formulas. I used DIVIDE AND CONCURE for which problem is excellent but Challenge-team don't allow us recursion and converting the algorithm to iteration made it less clear. svr Re: algorithm [12] // Problem 1511. Fiscal Operations 24 Jan 2007 11:26 To compare different algo some test using my Ac program here: 99 1 300 2 1111 66 7777 12 1111 66 77777 46 100 1 9999 61 99 99 1000 -1 1 80 201 12 4 8 99 15 345321543 123215642 876543129 21 Lomir Re: algorithm [8] // Problem 1511. Fiscal Operations 24 Jan 2007 19:41 My program pass all this tests. However i got WA6... :( svr Re: algorithm [7] // Problem 1511. Fiscal Operations 24 Jan 2007 23:09 Be must careful with first digits. They can't be =0. But if digit only one? Acording to problem statement it also <>0 because it also first. But I gueesd that for 1 digit it can be =0 and have AC. KIRILL(ArcSTU) Re: algorithm [5] // Problem 1511. Fiscal Operations 24 Jan 2007 23:21 Can anybody give me a hint how to solve it? svr Re: algorithm [4] // Problem 1511. Fiscal Operations 24 Jan 2007 23:41 Most simple to understand- use Divide and concure method. You solve the problem separetely for 1 and 2 halfs of strings and add optimal results. Blocs must be agreeed by means of common Carry fron 2 to 1. Exit from recursion when size of block=1,or only one digit. It this case use optimization by full search. Shortly to say it is problem from positioning number systems. svr Re: algorithm [2] // Problem 1511. Fiscal Operations 25 Jan 2007 00:14 Continuation. Alternative method- dynamic programming. We start witn 1-digits blocs. Let N- numder of them. We solve the problem for each one and store result in array. After we buld N/2 blocs with size 2 using array for 1-blocs. Result write to the same array. And so on: building blocs, containing 4,8,.. digits. Finally we will have one block with size N and array[0]- the answer. To agreed blocs on each stage array must depend also on in and out carries of each block. Edited by author 25.01.2007 00:15 Edited by author 25.01.2007 00:15 KIRILL(ArcSTU) Re: algorithm [1] // Problem 1511. Fiscal Operations 25 Jan 2007 00:48 Thank you for explanation! Fetisov Alex [USTU Frogs] Re: algorithm // Problem 1511. Fiscal Operations 24 Mar 2008 12:03 Or this problem can be solved using DP digit by digit, without any blocks) Fox Re: algorithm // Problem 1511. Fiscal Operations 10 Apr 2008 20:32 =) very thanks to all who give sample tests and explain recursive algorithm!!! At last I've got AC Denis Koshman Re: algorithm // Problem 1511. Fiscal Operations 17 Jul 2008 21:30 My AC solution never allows first digit to become zero, even for one-digit-long numbers. Also, BE AWARE that there are test(s) with leading zeroes, at least test #15. Sergey Tihon Re: algorithm [1] // Problem 1511. Fiscal Operations 11 Jul 2008 15:00 svr wrote 24 January 2007 11:26 345321543 that test is wrong.123215642 876543129 21 correct answer is 20. Denis Koshman Re: algorithm // Problem 1511. Fiscal Operations 17 Jul 2008 21:44 My AC solution gives 21 as well. Check if you do not allow carryover past leading digit, leading zero, etc... Denis Koshman Re: algorithm // Problem 1511. Fiscal Operations 17 Jul 2008 21:27 svr, thanks for your tests! They helped me to find a bug :) (I could allow leading zero for the 3rd number) Donat Does anyone has the test #6? (-) [1] // Problem 1511. Fiscal Operations 22 Mar 2007 11:31 Subj TObject Re: Does anyone has the test #6? (-) // Problem 1511. Fiscal Operations 31 Aug 2007 13:59 I'm!!!! but down on 7th test Lomir Some clarification please.. [1] // Problem 1511. Fiscal Operations 18 Jan 2007 18:48 "Each digit of the number should be corrected separately. A correction procedure means a replacing an erroneous digit with a correct one." So i can correct only one digit in each column (position)? Or any digits that i want? What is the coreect answer for: 9 1 1 -1 or 9? P.S. Maybe somebody has some clues on Test 6? Edited by author 18.01.2007 18:48 TheBeet Re: Some clarification please.. // Problem 1511. Fiscal Operations 31 Jan 2007 12:05 It must be 9 9 --> 8 cost 1 1 --> 1 cost 0 1 --> 9 cost 8 No leading zero total cost is 9
|