| ENG RUS | Timus Online Judge |
Общий форумKeworker `~ Overrated [1] // Задача 1154. Сражение магов 14 авг 2024 13:02 This task has some problems with accurancy, but 878 is too big rating for it. Solver Re: Overrated // Задача 1154. Сражение магов 11 июл 2026 09:16 Agreed. On precision - performing multiplications before division and comparing at 1e-8 works. Lebedev_Nicolay[Ivanovo SPU] Need Clarification! [3] // Задача 1277. Cops and Thieves 24 июл 2009 21:19 Can anybody expalain me this problem? I think that in both samples answer is YES, because all vertices are next to refuge or to museum. Lebedev_Nicolay[Ivanovo SPU] Re: Need Clarification! [2] // Задача 1277. Cops and Thieves 2 фев 2010 00:31 At last I've solved it. what about solution: 1) for maxflow use RelabelToFront 2) WA 36 : try this test 5 3 2 2 3 1 2 3 1 2 2 3 answer: NO 3) WA 38: test 5 3 2 2 2 1 2 3 1 2 2 3 answer: NO Edric Mao Re: Need Clarification! [1] // Задача 1277. Cops and Thieves 5 ноя 2011 18:44 Thanks a lot Solver Re: Need Clarification! // Задача 1277. Cops and Thieves 11 июл 2026 07:27 Thanks frost_nova WA#6 [6] // Задача 1547. Перебор паролей 12 май 2007 03:36 Dmytro Dziuma (DixonD) [Lviv NU] Re: WA#6 [5] // Задача 1547. Перебор паролей 8 мар 2008 19:26 Try test 2 27 morbidel Re: WA#6 [4] // Задача 1547. Перебор паролей 19 мар 2008 18:51 I got also WA at #6 and made some tests on the input. It seems that the line if (N == 34 && M == 49) while (1); got TLE (6) so the test is 34 49. My answer to this test is a-niaacgvtxwdouniwkovyjlpaaaerlqkyo niaacgvtxwdouniwkovyjlpaaaerlqkyp-aaarepihxnlfzhjsqrzpokzcbpyfypjwat aaarepihxnlfzhjsqrzpokzcbpyfypjwau-aqaaaaaaaaiiovpgvvmsnhsbbrtjgmuqbw aqaaaaaaaaiiovpgvvmsnhsbbrtjgmuqbx-bejdhnxluhaaainzrkuauccrqbastmtecb bejdhnxluhaaainzrkuauccrqbastmtecc-bssejrqozpnkflharcuholuvjdvwynyaaa bssejrqozpnkflharcuholuvjdvwynyaaa-chbflvjseyarrdiqpnyomjekfzqbtgnktz chbflvjseyarrdiqpnyomjekfzqbtgnkua-cvkgnzcvkgnzcvkgnzcvkgnzcvkgnzcvkm cvkgnzcvkgnzcvkgnzcvkgnzcvkgnzcvkn-djthqcvyppbgonlwmkhcidxnzrelirsgaz djthqcvyppbgonlwmkhcidxnzrelirsgba-dycisgpbuxooafnmkvljgbhcwmyqdkhqrm dycisgpbuxooafnmkvljgbhcwmyqdkhqrn-emljukifaapbxjvblttjroekmwfuxvlxyx emljukifaapbxjvblttjroekmwfuxvlxyy-faukwobifopcxpqshrtxbwaaaxbkkpmjnr faukwobifopcxpqshrtxbwaaaxbkkpmjns-fpdlyrulkxckjhsigcydztjvnaayrhdnnv fpdlyrulkxckjhsigcydztjvnaayrhdnnw-gdmnachtlazghlttujryytfbucbeeqsbil gdmnachtlazghlttujryytfbucbeeqsbim-grvoczgrvoczgrvoczgrvoczgrvoczgrvv grvoczgrvoczgrvoczgrvoczgrvoczgrvw-hgepfczvawqgsjxebkkytlmodnpsxrwcmh hgepfczvawqgsjxebkkytlmodnpsxrwcmi-hunqhgsygfdoebytzvpfriwdajjxsklnct hunqhgsygfdoebytzvpfriwdajjxsklncu-iiwrjkmblnqvpuajygtmpgfrxfecndaxtf iiwrjkmblnqvpuajygtmpgfrxfecndaxtg-ixfslofeqwedbmbzwrxtndpguayhhvqijr ixfslofeqwedbmbzwrxtndpguayhhvqijs-jlotnryhwerknedpvdcalayvqwsmcoftaa jlotnryhwerknedpvdcalayvqwsmcoftaa-jzxupvrlbnerywfftoghiyiknsmqxgvdqp jzxupvrlbnerywfftoghiyiknsmqxgvdqq-kogvrzkogvrzkogvrzkogvrzkogvrzkohb kogvrzkogvrzkogvrzkogvrzkogvrzkohc-lcpwuddrmefgwgilqkovetbohkbamrzyxn lcpwuddrmefgwgilqkovetbohkbamrzyxo-lqyxwgwurmsohykbovtccqldefvfhkpjnz lqyxwgwurmsohykbovtccqldefvfhkpjoa-mfhyykpxwvfvtqlrngxjanusbbpkcdeuel mfhyykpxwvfvtqlrngxjanusbbpkcdeuem-mtraaaaaaadyagcaylnbwefjfiwhlkxzyt mtraaaaaaadyagcaylnbwefjfiwhlkxzyu-niaaaaaamqmtnchcwhigpdmsazucrszvdb niaaaaaamqmtnchcwhigpdmsazucrszvdc-nwjcevvhmutscsqniokdufxkroxymgzaaa nwjcevvhmutscsqniokdufxkroxymgzaaa-oksdgzoksdgzoksdgzoksdgzoksdgzoksh oksdgzoksdgzoksdgzoksdgzoksdgzoksi-ozbejdhnxluhaabhlcxuvdfatyrziklvtv ozbejdhnxluhaabhlcxuvdfatyrziklvtw-pnkflharcuholuvjdvwynyaabjmfvzjyxn pnkflharcuholuvjdvwynyaabjmfvzjyxo-qbtgnktuicuvxmwzchbflvjseyarrdiqpr qbtgnktuicuvxmwzchbflvjseyarrdiqps-qqchpomxnlidjeypacedivahvrcqaaaaaa qqchpomxnlidjeypacedivahvrcqaaaaaa-relirsgastvkuxaezdjthqcvyppbgonlwp relirsgastvkuxaezdjthqcvyppbgonlwq-rsujtvzdycisgpbuxooafnmkvljgbhcwnb rsujtvzdycisgpbuxooafnmkvljgbhcwnc-shdkvzshdkvzshdkvzshdkvzshdkvzshdn shdkvzshdkvzshdkvzshdkvzshdkvzshdo-svmlydlkitjhdzfaukwobifopcxpqshrtz svmlydlkitjhdzfaukwobifopcxpqshrua-tjvnacjothflsugpqhyezmsbiabaabensx tjvnacjothflsugpqhyezmsbiabaabensy-tyeockxqtkjwbjigrhfbxcysiulzgdmnax tyeockxqtkjwbjigrhfbxcysiulzgdmnay-umnpeoqtysxdnbjwpsjivaihfqgeawbxrj umnpeoqtysxdnbjwpsjivaihfqgeawbxrk-vawqgsjxebkkytlmodnpsxrwcmaivorihv vawqgsjxebkkytlmodnpsxrwcmaivorihw-vpfriwdajjxsklncmorwqvbkzhunqhgsyh vpfriwdajjxsklncmorwqvbkzhunqhgsyi-wdoskzwdoskzwdoskzwdoskzwdoskzwdot wdoskzwdoskzwdoskzwdoskzwdoskzwdou-wrxtndpguayhhvqijlabeukemqvwvdoaaa wrxtndpguayhhvqijlabeukemqvwvdoaaa-xgguphijzjlotnryhwerknedpvdcaaaaud xgguphijzjlotnryhwerknedpvdcaaaaue-xupvrlbnerywfftoghiyiknsmqxgvdqjmd xupvrlbnerywfftoghiyiknsmqxgvdqjme-yiywtouqkamdqxveesnfghxhjmrlpwfucp yiywtouqkamdqxveesnfghxhjmrlpwfucq-yxhxvsntpizlcpwuddrmefgwgilqkovetb yxhxvsntpizlcpwuddrmefgwgilqkovetc-zlqyxwgwurmsohykbovtccqldefvfhkpjn zlqyxwgwurmsohykbovtccqldefvfhkpjo-zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz Can anyone write the correct answer? Thank you Edited by author 19.03.2008 18:53 morbidel Re: WA#6 [1] // Задача 1547. Перебор паролей 19 мар 2008 19:26 I don't understant what's wrong, here are the number of pieces each processor has: 34 49 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683277 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 27285448088939550474430463423979178157730683276 (26^34) % M = 10 so I distributed the 10 remaining strings on the first processors, according to the sample test (when the remainder was 2) Any hint? morbidel Re: WA#6 // Задача 1547. Перебор паролей 22 мар 2008 04:20 solved! 'bssejrqozpnkflharcuholuvjdvwynyaaa' on processor 5 and 6 is obviously wrong IgorKoval [PskovSU] Re: WA#6 [1] // Задача 1547. Перебор паролей 15 мар 2012 23:34 input: 34 49 output: a-niabcscehmgkraoxkdfwwinvutdtrojpm niabcscehmgkraoxkdfwwinvutdtrojpn-abrbdglfjpznwjcevvhmutscsqniokdufz abrbdglfjpznwjcevvhmutscsqniokduga-aqacfkeioymvibduugltsrbrpmhnjctewm aqacfkeioymvibduugltsrbrpmhnjctewn-bejdhnxluhacttfksrqaqolgmibsdvipmz bejdhnxluhacttfksrqaqolgmibsdvipna-bssejrqozpnkflharcuholuvjdvwynyadm bssejrqozpnkflharcuholuvjdvwynyadn-chbflvjseyarrdiqpnyomjekfzqbtgnktz chbflvjseyarrdiqpnyomjekfzqbtgnkua-cvkgnzcvkgnzcvkgnzcvkgnzcvkgnzcvkm cvkgnzcvkgnzcvkgnzcvkgnzcvkgnzcvkn-djthqcvyppbgonlwmkhcidxnzrelirsgaz djthqcvyppbgonlwmkhcidxnzrelirsgba-dycisgpbuxooafnmkvljgbhcwmyqdkhqrm dycisgpbuxooafnmkvljgbhcwmyqdkhqrn-emljukifagbvlxpcjgpqdyqrtisuycxbhz emljukifagbvlxpcjgpqdyqrtisuycxbia-faukwobifopcxpqshrtxbwagqemzsvmlyl faukwobifopcxpqshrtxbwagqemzsvmlym-fpdlyrulkxckjhsigcydztjvnahenobwox fpdlyrulkxckjhsigcydztjvnahenobwoy-gdmnavnoqfpruztyeockxqtkjwbjigrhfj gdmnavnoqfpruztyeockxqtkjwbjigrhfk-grvoczgrvoczgrvoczgrvoczgrvoczgrvv grvoczgrvoczgrvoczgrvoczgrvoczgrvw-hgepfczvawqgsjxebkkytlmodnpsxrwcmh hgepfczvawqgsjxebkkytlmodnpsxrwcmi-hunqhgsygfdoebytzvpfriwdajjxsklnct hunqhgsygfdoebytzvpfriwdajjxsklncu-iiwrjkmblnqvpuajygtmpgfrxfecndaxtf iiwrjkmblnqvpuajygtmpgfrxfecndaxtg-ixfslofeqwedbmbzwrxtndpguayhhvqijr ixfslofeqwedbmbzwrxtndpguayhhvqijs-jlotnryhwerknedpvdcalayvqwsmcoftad jlotnryhwerknedpvdcalayvqwsmcoftae-jzxupvrlbnerywfftoghiyiknsmqxgvdqp jzxupvrlbnerywfftoghiyiknsmqxgvdqq-kogvrzkogvrzkogvrzkogvrzkogvrzkohb kogvrzkogvrzkogvrzkogvrzkogvrzkohc-lcpwuddrmefgwgilqkovetbohkbamrzyxn lcpwuddrmefgwgilqkovetbohkbamrzyxo-lqyxwgwurmsohykbovtccqldefvfhkpjnz lqyxwgwurmsohykbovtccqldefvfhkpjoa-mfhyykpxwvfvtqlrngxjanusbbpkcdeuel mfhyykpxwvfvtqlrngxjanusbbpkcdeuem-mtraaojbcdtdfinhlsbpylegxxjowvueux mtraaojbcdtdfinhlsbpylegxxjowvueuy-niabcscehmgkraoxkdfwwinvutdtrojplj niabcscehmgkraoxkdfwwinvutdtrojplk-nwjcevvhmutscsqniokdufxkroxymgzabv nwjcevvhmutscsqniokdufxkroxymgzabw-oksdgzoksdgzoksdgzoksdgzoksdgzoksh oksdgzoksdgzoksdgzoksdgzoksdgzoksi-ozbejdhnxluhacttfksrqaqolgmibsdvit ozbejdhnxluhacttfksrqaqolgmibsdviu-pnkflharcuholuvjdvwynyadicgmwktfzf pnkflharcuholuvjdvwynyadicgmwktfzg-qbtgnktuicuvxmwzchbflvjseyarrdiqpr qbtgnktuicuvxmwzchbflvjseyarrdiqps-qqchpomxnlidjeypasfmjsthbtuwlvybgd qqchpomxnlidjeypasfmjsthbtuwlvybge-relirsgastvkuxaezdjthqcvyppbgonlwp relirsgastvkuxaezdjthqcvyppbgonlwq-rsujtvzdycisgpbuxooafnmkvljgbhcwnb rsujtvzdycisgpbuxooafnmkvljgbhcwnc-shdkvzshdkvzshdkvzshdkvzshdkvzshdn shdkvzshdkvzshdkvzshdkvzshdkvzshdo-svmlydlkitjhdzfaukwobifopcxpqshrtz svmlydlkitjhdzfaukwobifopcxpqshrua-tjvnahenobwoprgqswauzfpdlyrulkxckl tjvnahenobwoprgqswauzfpdlyrulkxckm-tyeockxqtkjwbjigrhfbxcysiulzgdmnax tyeockxqtkjwbjigrhfbxcysiulzgdmnay-umnpeoqtysxdnbjwpsjivaihfqgeawbxrj umnpeoqtysxdnbjwpsjivaihfqgeawbxrk-vawqgsjxebkkytlmodnpsxrwcmaivorihv vawqgsjxebkkytlmodnpsxrwcmaivorihw-vpfriwdajjxsklncmorwqvbkzhunqhgsyh vpfriwdajjxsklncmorwqvbkzhunqhgsyi-wdoskzwdoskzwdoskzwdoskzwdoskzwdot wdoskzwdoskzwdoskzwdoskzwdoskzwdou-wrxtndpguayhhvqijlakmpuoszixfsloff wrxtndpguayhhvqijlakmpuoszixfslofg-xgguphijzjlotnryhwerknedpvdcalayvr xgguphijzjlotnryhwerknedpvdcalayvs-xupvrlbnerywfftoghiyiknsmqxgvdqjmd xupvrlbnerywfftoghiyiknsmqxgvdqjme-yiywtouqkamdqxveesnfghxhjmrlpwfucp yiywtouqkamdqxveesnfghxhjmrlpwfucq-yxhxvsntpizlcpwuddrmefgwgilqkovetb yxhxvsntpizlcpwuddrmefgwgilqkovetc-zlqyxwgwurmsohykbovtccqldefvfhkpjn zlqyxwgwurmsohykbovtccqldefvfhkpjo-zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz Solver Re: WA#6 // Задача 1547. Перебор паролей 10 июл 2026 01:22 Thanks for the test :) I solved it using base-26 long arithmetics, but forgot to prepend leading zeroes (leading 'a'), so could output "brg" instead of "aabrg" Nikita Mogilevets Possible way to solve it (long arithmetic ) [1] // Задача 1547. Перебор паролей 14 май 2017 22:02 Calculate powers of 26 and prefix sums of powers of 26. Calculate ranges by integer division. Calculate each password from left to right like you would calculate k-permutation using factorial digit system. Solver Re: Possible way to solve it (long arithmetic ) // Задача 1547. Перебор паролей 10 июл 2026 01:06 Base-26 arithmetics simplifies things a lot here :) Denis Koshman What if pawns eats bishop? [2] // Задача 1398. Слон и пешка 6 авг 2008 06:16 It's not clear if black player can continue movement or not after eating white bishop. Fyodor Menshikov Re: What if pawns eats bishop? [1] // Задача 1398. Слон и пешка 22 апр 2009 19:11 Bishop moves first, so if at first pawn can capture bishop it does not matter. On the next moves bishop can avoid such positions where pawn can capture it. Solver Re: What if pawns eats bishop? // Задача 1398. Слон и пешка 9 июл 2026 23:39 Just according to problem statement it's white wins :), so looks weird coder ADMIN! // Задача 2137. Динамическая сложность строки 9 июл 2026 22:45 Please, check 142 test, C++ fread failed for this test case. scanf accepted. After fread I can try trim space symbols (ASCII code <= 32) from start and end, any more WA142. Alexandru Farcasanu Any hint? [5] // Задача 1915. Руины титанов: воссоздание былого 20 окт 2012 23:26 Any hint for solving this problem? green_smile Re: Any hint? // Задача 1915. Руины титанов: воссоздание былого 21 окт 2012 00:17 may be stack? Ilya Shakirov [Perm SU] Re: Any hint? [2] // Задача 1915. Руины титанов: воссоздание былого 21 окт 2012 13:05 number of possible operations is only 1m Bogatyr Re: Any hint? // Задача 1915. Руины титанов: воссоздание былого 21 окт 2012 16:50 > number of possible operations is only 1m Hah! Somehow reading this here (even though it's clear in the problem statement) made me see the way...thanks. Dmi3Molodov best Hint!!! // Задача 1915. Руины титанов: воссоздание былого 9 июл 2026 22:39 std::copy_backward ONCE! Didi (OSU11) Re: Any hint? // Задача 1915. Руины титанов: воссоздание былого 4 ноя 2012 19:05 memcpy (for c++) and million.., and not any more ;p coder How solve it O(N) ? // Задача 2137. Динамическая сложность строки 9 июл 2026 22:09 Denis Koshman If you have WA12 [2] // Задача 1269. Антимат 25 авг 2008 19:08 Try this test: 2 abc b 1 abc Correct answer: 1 1 sailingoat Re: If you have WA12 [1] // Задача 1269. Антимат 29 янв 2025 22:34 THANK YOU SO MUCH ! ! !! Solver Re: If you have WA12 // Задача 1269. Антимат 9 июл 2026 21:04 Thanks :) Arthas Please add these tests. [2] // Задача 1466. Магический квадрат 19 май 2009 07:14 3 5 1 4 5 7 3 8 2 4 4 7 5 3 7 7 0 3 5 2 5 1 5 3 4 3 8 8 8 6 0 6 6 1 I got tle on these tests.But I got AC. 👨🏻💻 Spatarel Dan Constantin Re: Please add these tests. [1] // Задача 1466. Магический квадрат 2 авг 2019 18:42 My AC solution outputs "NO" on both of those test cases. Igor Parfenov Re: Please add these tests. // Задача 1466. Магический квадрат 9 июл 2026 19:16 Answer to second test is YES. And, moreover, there are 840 ways to fill the square. Upd. Sorry, forgot about constraint a[0][0]=0. (But, if ignore it, 840 is correct number.) Edited by author 09.07.2026 19:19 Solver Complexity // Задача 2226. Графство белок 9 июл 2026 12:20 O(N) for RAM and CPU, don't know why memory limit is that high. Based on classics for tree diameter. Sq1 Start time is 0 or 1 ? [1] // Задача 2009. Очереди в столовой 7 янв 2017 00:02 Solver Re: Start time is 0 or 1 ? // Задача 2009. Очереди в столовой 9 июл 2026 08:55 Doesn't matter, could be -1000 Lomir What is the maximum number of divisions needed? [3] // Задача 1468. Дробь 3 июл 2007 18:02 What is the maximum number of divisions needed to get the full period? I got TLE this O(n^2) algo there n is the number of divisions. Lomir Re: What is the maximum number of divisions needed? [2] // Задача 1468. Дробь 3 июл 2007 18:15 O(n*lg n) from number of divisions also TLE. But why...? Lomir Re: What is the maximum number of divisions needed? [1] // Задача 1468. Дробь 3 июл 2007 18:26 O(n) AC in 0.234 O(n^2) memorization of prev remainders in vector with linear search O(n*lg n) memorization of prev remainders in set O(n) just used bitset<10000> cause all remainders is less then 10000 But why O(n*lg n) TLE!?!?!? Solver Re: What is the maximum number of divisions needed? // Задача 1468. Дробь 9 июл 2026 07:22 just remember position for each remainder, once stepped over again - period detected. O(b) memory, O(b) runtime linjek AC [1] // Задача 1016. Кубик на прогулке 9 авг 2014 16:51 You can solve that with algo Djikstra. We have 6!*8*8 vertex (hash of cube and point) . And all vertexs have <=4 edges. P.s. sry for English ) Edited by author 09.08.2014 16:51 Solver Re: AC // Задача 1016. Кубик на прогулке 9 июл 2026 02:00 there are only 24 orientations Skeef79 This is pretty simple task [1] // Задача 2112. Полевые логи 15 авг 2019 23:45 just use DSU to check teams, and then build answer Solver Re: This is pretty simple task // Задача 2112. Полевые логи 9 июл 2026 01:27 why dsu? just bfs on revival links. if component >4 - FAKE. then fill up 3+1, 2+2, 2+1+1, 1+1+1+1 Ade For WA6 [1] // Задача 1629. Перелёт 13 июн 2023 20:43 The first day has no delay flight from the day before. 2 1 60 100 23:00 He can departure from 24:00 , not 00:00 Solver Re: For WA6 // Задача 1629. Перелёт 8 июл 2026 23:50 Thanks, but with this change just for the 1st flight it gets WA13 :) The right solution is to get yesterday flights only when current time spent is >= 1440. Problem statement lacks "from this moment" phrase which exists in russian version. Edited by author 08.07.2026 23:57 LaVuna [KHNURE] O(W*H) solution passes [1] // Задача 1235. Cricket Field 22 авг 2021 13:43 O(W*H) solution passes Edited by author 22.08.2021 13:50 Edited by author 22.08.2021 13:50 Solver Re: O(W*H) solution passes // Задача 1235. Cricket Field 8 июл 2026 23:26 I did it O(N^3) way, but can be done O(N^2*log(N)) Edited by author 08.07.2026 23:43 MYLS Doubts about using the random number. [3] // Задача 1333. Джинн-бомбардировки 2 25 фев 2014 23:03 In my programme, I use 1000 000 random locations to check if the points are in the circle. At first, I wrote something like this: "double tx = ( double )( rand() % 101 ) / 100.0 ";(because: 0 ≤ x ≤ 1, -> rand() % 101 ∈[ 0, 100 ] );and just got WA...... Finally I changed the 101 into 100 and got AC; Can anyone tell me why 101 is incorrect? or it is actually right? Vedernikoff 'Goryinyich' Sergey (HSE: АОП) Re: Doubts about using the random number. [1] // Задача 1333. Джинн-бомбардировки 2 25 фев 2014 23:42 You're just lucky that in the second case you got AC - actually good tests will kill your second solution as well, because what you generate is random point on integer grid 100 x 100 and this is far from random real point. Good way of generating random point in unit square is doing double(rand()) / RAND_MAX for both coordinates - this will give you point close enough to truly random. MYLS Re: Doubts about using the random number. // Задача 1333. Джинн-бомбардировки 2 1 авг 2014 12:29 Thanks for your reply, I realize I have mixed up continuity and dispersion. :-） Dmi3Molodov Re: Don't use random numbers. // Задача 1333. Джинн-бомбардировки 2 8 июл 2026 16:57 This contradicts the condition of the task. It is ALWAYS required to have the correct answer. Use regular points. ~'Yamca`~ this test help me [1] // Задача 2168. Руны в поле 6 май 2026 05:10 WA8: 6 aabcaa ans: 6 RE9: 7 aaaaaaa ans: 7 coder Re: this test help me // Задача 2168. Руны в поле 8 июл 2026 14:28 Did use suffix automaton? Or give me any hint please. Aneto why I get wa on test 23? [4] // Задача 1772. Лыжни для роботов 28 июл 2010 21:06 why I get wa on test 23? Aneto Re: why I get wa on test 23? [3] // Задача 1772. Лыжни для роботов 31 июл 2010 04:01 this problem ROCKS >D r1d1 Re: why I get wa on test 23? [2] // Задача 1772. Лыжни для роботов 1 авг 2010 08:32 Try it: 8 3 3 2 4 5 8 1 6 Answer: 6 Marginean Ciprian Re: why I get wa on test 23? [1] // Задача 1772. Лыжни для роботов 22 сен 2010 15:14 What is the answer for the test: 10 5 2 2 8 4 6 ? Mine is 4. Am I correct? Or is the answer 6 or 10? L.E.: Nevermind I ACed. Answer is 4. Edited by author 22.09.2010 20:24 Edited by author 24.09.2010 01:45 Solver Re: why I get wa on test 23? // Задача 1772. Лыжни для роботов 8 июл 2026 10:02 I had RE23 because of this vector<int> l(n), r(n); // should be 'k'
|