| ENG RUS | Timus Online Judge |
Обсуждение задачи 1435. Финансовая ошибкаiron_orc Is python solution even possible? TLE #43 [1] // Задача 1435. Финансовая ошибка 16 май 2021 10:11 Always got TLE 43. I've tried different optimization on python, but nothing work. C++ with same code and std::getline optimization got AC with almost TLE 300-350msec. And as I see no one has AC with Python =\ yyll Re: Is python solution even possible? TLE #43 // Задача 1435. Финансовая ошибка 7 фев 2022 09:13 yes. AC in 0.312s 💻Evgeny Nemtsev [UrFU FT-17]'` WA 10 // Задача 1435. Финансовая ошибка 5 апр 2017 17:54 2 10 15 16 -> Unrecoverable error. (not "Error in record #1. Correct number is: 1.") Justine Tsiga WA 9 // Задача 1435. Финансовая ошибка 17 мар 2016 22:05 Can you give me some examples, please! 🦄 Slava Shklyaev To admins: Please delete these submissions // Задача 1435. Финансовая ошибка 8 фев 2016 11:35 A lot of CE submissions by multiple users in a time span of a few minutes: http://acm.timus.ru/status.aspx?space=1&num=1435&from=6609399&count=97 Leonid (SLenik) Andrievskiy WA4 = the test with several possible answers // Задача 1435. Финансовая ошибка 5 сен 2015 15:30 For example 3 12 23 23 67 There are three correct answers: Error in record #1. Correct number is: 21. Error in record #2. Correct number is: 32. Error in record #3. Correct number is: 32. Wrong answer for this test: Unrecoverable error. popolwooh WA #7 // Задача 1435. Финансовая ошибка 4 апр 2014 22:48 Check this: 2 10 10 110 fatalisPM WA18 // Задача 1435. Финансовая ошибка 19 фев 2013 00:32 What 's special in 18'th test? Timur Sitdikov (MSU Tashkent) WA 25 // Задача 1435. Финансовая ошибка 8 июн 2011 12:20 If WA 25, try this: 1 1010 1100 Error in record #1. Correct number is: 1100. Alexey Shmelev [NNSU] Note (for clear problem description understanding) // Задача 1435. Финансовая ошибка 14 май 2010 00:37 You are not allowed to swap digits in the last number (the sum of N numbers) Example ------- Input: 2 11 20 13 Output: Unrecoverable error. M@STeR.SoBG WA#22 [2] // Задача 1435. Финансовая ошибка 9 ноя 2006 17:09 Who has WA this test. What's wrong? Could you give me some tests. M@STeR.SoBG Re: WA#22 [1] // Задача 1435. Финансовая ошибка 9 ноя 2006 17:25 What is the correct answer for this test? Is "Error in record #2. Correct number is: 9."? 2 10 90 19 Afgan Abbasov[Azerbaijan] Re: WA#22 // Задача 1435. Финансовая ошибка 9 апр 2010 00:20 Answer: Unrecoverable error. Maybe this test help you 3 335 111 222 667 Answer: Unrecoverable error. Vladimir Yakovlev (USU) Changes in problem 1435 Financial Error [3] // Задача 1435. Финансовая ошибка 16 мар 2009 01:23 The limitation on N is reduced from 1500000 to 200000. The time limit is reduced from 2 seconds to 0.4 seconds. Tests that do not meet the new limitations are removed. New tests for various tricky cases are added. All solutions have been rejudged. Vedernikoff Sergey (HSE: EconomicsForever!) Re: Changes in problem 1435 Financial Error [2] // Задача 1435. Финансовая ошибка 16 мар 2009 01:37 Wow, results for the contest are also reviewed - I went up =) NickSergeev[MSU MindCraft] Re: Changes in problem 1435 Financial Error [1] // Задача 1435. Финансовая ошибка 16 мар 2009 01:49 Why? it's so stupid for me to resolving that not - interesting problem! Are you CrAzY? Vladimir Yakovlev (USU) You may not resolve it if you don't want // Задача 1435. Финансовая ошибка 16 мар 2009 02:09 It is our rule to add new tests to old problems. If your solution gives incorrect results or works slowly in some cases, why it should be stored here with Accepted status? It will be unfair to those who will solve this problem with new tests. Anton [SUrSU] WA#6 [4] // Задача 1435. Финансовая ошибка 11 июл 2006 00:50 Why I've got WA. My algo is simple... Give me some usefull tests PLEASE DixonD (Lviv NU) Re: WA#6 [3] // Задача 1435. Финансовая ошибка 17 июл 2007 16:16 Any idea why WA #6? I've got it many times... DixonD (Lviv NU) Re: WA#6 [2] // Задача 1435. Финансовая ошибка 17 июл 2007 16:45 It was a stupid bug... It's all right now. I've got AC Edited by author 17.07.2007 16:49 Dmitry "Logam" Kobelev [TSOGU] WA#6 [1] // Задача 1435. Финансовая ошибка 10 авг 2008 23:18 I puzzled with it too... does someone know what the point? Dmitry "Logam" Kobelev [TSOGU] Re: WA#6 // Задача 1435. Финансовая ошибка 10 авг 2008 23:39 There was really great mistake in my code. test 6 seem to maintain just digits swapping in the middle of number. M@STeR.SoBG WA #45 [2] // Задача 1435. Финансовая ошибка 25 янв 2007 04:20 I've got WA #45. i can't understand my mistake! Help me please! Akim Re: WA #45 [1] // Задача 1435. Финансовая ошибка 3 июн 2007 18:34 Test No45 contains something like this: 1 1900000000 9100000000 Just use Int64 instead of LongInt; Denis Koshman Re: WA #45 // Задача 1435. Финансовая ошибка 10 авг 2008 16:56 A good one :) goodguy wrong problem statement [1] // Задача 1435. Финансовая ошибка 9 мар 2006 00:02 I was getting WA for a while because I didnt know that the test: 10 1 2 is "Unrecoverable error." I think the problem statement tells this in a wrong way: 'besides no leading zeroes can appear as a result of erroneous copying'. but this can mean this too: the ACCOUNTANT hasnt copied for example 10 as 01. Denis Koshman Re: wrong problem statement // Задача 1435. Финансовая ошибка 10 авг 2008 16:42 This means that no number before or after swapping has leading zeroes. So, the number 10 is written correctly, it can't be result of mistake. As well as number 1. Lomir scanf() // Задача 1435. Финансовая ошибка 6 май 2007 18:43 Do not use scanf("%lld", &n); or you will get WA. Only scanf("%I64d", &n); Same with printf() for long long data type. KAV I think it's the fastest, but TLE - ??? [11] // Задача 1435. Финансовая ошибка 4 мар 2006 10:56 I use such an algorithm: SumNeed - the last number in the input, what it's need to have sum - the physical sum of all numbers If ( SumNeed - sum ) does not divide by 9 - unrecoverable error. Else ( SumNeed - sum ) / 9 is the difference between swapped digits. So I look through all the numbers, and if there are digits with difference ( SumNeed-sum )/9 - it is the mixed number. On my computer when N=1500000 it works nearly 0.1 sec, and how it gets TLE - I can't even imagine. :( [code cut] Edited by moderator 16.03.2009 01:25 Burmistrov Ivan (USU) Re: I think it's the fastest, but TLE - ??? // Задача 1435. Финансовая ошибка 4 мар 2006 21:58 Use scanf()! I had same problem. But now I have WA #45 :( Any hints? :) Burunduk1 Re: I think it's the fastest, but TLE - ??? [9] // Задача 1435. Финансовая ошибка 5 мар 2006 01:36 The fastest one: Don't read numbers as integers! Read it as string or char[] This way brings AC 0.18 sec PS: In such problems (input data is large and TL is small) don't use scanf or cin to read integer numbers. KAV Re: I think it's the fastest, but TLE - ??? [8] // Задача 1435. Финансовая ошибка 5 мар 2006 15:53 So, you think that the algorithm is good, but reading input takes all the time? Well, I will try to change, to read strings. Thanks! KAV Re: I think it's the fastest, but TLE - ??? [7] // Задача 1435. Финансовая ошибка 9 мар 2006 09:17 Thanks to all, I have converted the algorithm into strings, now it is about 0.25 sec. But - WA 45 :( I can't guess why. Is unsigned __int64 enough? Burmistrov Ivan (USU), you told that you also had WA 45. Have you overcome this problem? Vladimir Yakovlev (USU) Have you read updated problem statement? [1] // Задача 1435. Финансовая ошибка 9 мар 2006 12:32 KAV Re: Have you read updated problem statement? // Задача 1435. Финансовая ошибка 9 мар 2006 17:11 It's very strange!!! Statement: "Each of the next N lines contains a corresponding non-negative integer summand (not exceeding 2^31-1)." 2^31 is 2147483648 - 10 symbols. All input numbers I kept in char[11] and got WA. When I changed the type into char[12] - I got Accepted!!! How to explain it? ;) !!! No question. My stupid fault :( YES, AC 0.171 8-) Edited by author 09.03.2006 17:22 Burmistrov Ivan (USU) Re: I think it's the fastest, but TLE - ??? [3] // Задача 1435. Финансовая ошибка 9 мар 2006 16:21 Now I have WA #46 :( In 45-th test correct number more than 2^31-1, I think. But what is 46-th test? Dr.Korbin Re: I think it's the fastest, but TLE - ??? [2] // Задача 1435. Финансовая ошибка 10 мар 2006 03:11 I have WA #46 :( What's the problem??! Dr.Korbin AC [1] // Задача 1435. Финансовая ошибка 10 мар 2006 03:21 O, I think I undestood, what was wrong. I had an array "long int a[1500000]", and other variables were __int64. When I corrected "__int64 a[1500000]", my program began to eat 12MB of memory instead of 6MB, but I got AC!!!! Edited by author 10.03.2006 03:22 Dan.hu Re: AC // Задача 1435. Финансовая ошибка 25 фев 2007 23:09 u are quite right! i got AC this way,too! Thx u for ur hints! but does it mean the judge writer use number greater than 2^31-1? if yes, i have a feeling of being fooled! Igor E. Tuphanov Re: I think it's the fastest, but TLE - ??? // Задача 1435. Финансовая ошибка 9 мар 2006 16:27 int64 is quite enough... Dembel {AESC USU} HELP ME! [5] // Задача 1435. Финансовая ошибка 7 дек 2006 13:56 I got WA#4. why? Please, Give me some tests. Edited by author 07.12.2006 14:06 Dembel {AESC USU} it's true? [4] // Задача 1435. Финансовая ошибка 7 дек 2006 15:03 Input 1 1 10 Output Unrecoverable error. Sandro (USU) Re: it's true? [3] // Задача 1435. Финансовая ошибка 11 дек 2006 18:57 Yes. It is true. But try this test: 2 34 23 66 Answer: Error in record #1. Correct number is: 43. Dembel {AESC USU} why? [2] // Задача 1435. Финансовая ошибка 12 дек 2006 23:51 I think Unrecoverable error. because 34+32=43+23=66. Edited by author 13.12.2006 00:05 Sandro (USU) Re: why? [1] // Задача 1435. Финансовая ошибка 13 дек 2006 00:57 ...If such number doesn't exist, then you should output the line "Unrecoverable error." ... If several numbers exist, any one will be OK. Dembel {AESC USU} Re: why? // Задача 1435. Финансовая ошибка 15 дек 2006 15:57 Thanks. I got AC. I can't read the Problem. SPIRiT Why WA 45 or 49 [2] // Задача 1435. Финансовая ошибка 31 май 2006 21:10 Who has those tests. Please answer, what's wrong with them ACM.Tolstobrov_Anatoliy[Ivanovo SPU] Re: Why WA 45 or 49 [1] // Задача 1435. Финансовая ошибка 1 июн 2006 15:27 1 10 1 1 1 10 gL Abbas Mehrabian Re: Why WA 45 or 49 // Задача 1435. Финансовая ошибка 9 окт 2006 18:37 The answer to both of them must be "Unrecoverable Error.", mustn't it? But I have WA #45 !! Dembel {AESC USU} Whether he can change figures in 2 different numbers simultaneously // Задача 1435. Финансовая ошибка 1 окт 2006 22:41 Edited by author 01.10.2006 22:41 DonNTU Team (Akulshin, Belikov, Trofimenko) How to solve this problem? I have TL37. // Задача 1435. Финансовая ошибка 14 сен 2006 20:58 My algo is very simple. He works O(N*k), where k is a number uf digits in the maximal number a[i].
|