| ENG RUS | Timus Online Judge |
Discussion of Problem 1343. Fairy TaleMaxxxCoder wa test 13 [1] // Problem 1343. Fairy Tale 10 Jun 2023 00:45 please can anyone give me test #13? MaxxxCoder Re: wa test 13 // Problem 1343. Fairy Tale 15 Jun 2023 19:17 oh i found the test 9 000123000 --------- 123000000143 (my program) SRC WA on test9. please tell me what the test is. [2] // Problem 1343. Fairy Tale 4 Aug 2015 20:57 SRC Re: WA on test9. please tell me what the test is. [1] // Problem 1343. Fairy Tale 4 Aug 2015 21:49 Got it. Never mind. It was simply a 12 digit input which is already prime. :) This problem is quite easy. Easier than a lot of problems with much less rated difficulty. Abid29 Re: WA on test9. please tell me what the test is. // Problem 1343. Fairy Tale 8 Mar 2021 18:12 thnx a lot 💻Evgeny Nemtsev [UrFU]` WA7 and WA10 // Problem 1343. Fairy Tale 3 Dec 2016 03:02 WA7 3 000 -> 000000000002 WA10 0 -> 000000000002 Bohe why the output of the sample is not 64631000033? [1] // Problem 1343. Fairy Tale 23 Oct 2015 11:19 do i misunderstand the meaning of this problem? 64631000033 is a prime,why it not the right answer of the sample? please help me!thanks! Jane Soboleva (SumNU) Re: why the output of the sample is not 64631000033? // Problem 1343. Fairy Tale 23 Oct 2015 16:56 If 64631000033 is a prime, it's also good. You should output any, not necessarily minimal. Rostislav No subject [3] // Problem 1343. Fairy Tale 19 Feb 2005 15:40 As far as I understand the tasks the 12 digit number should be prime. Can it have leading zeros? Can the number 646310000033 be a corect output for the sample input? And how to format long long (was it "%I64" ?)? Rostislav Edited by author 19.02.2005 15:48 ronobe (aka oberon) for my IMHO see in [1] // Problem 1343. Fairy Tale 19 Feb 2005 16:51 got AC +17... it SHOULD have leading zeros. L CAN be 0 digits CAN be separated by blanks. ALL IS MY IMHO Rostislav Re: for my IMHO see in // Problem 1343. Fairy Tale 19 Feb 2005 17:07 The problem was in the formating (always forget that the compiler is differnt from my own). Bohe Re: No subject // Problem 1343. Fairy Tale 23 Oct 2015 11:38 i have the same question as you，why is 64631000033 not the right answer，can you tell me，please？ DJPonnYash wa 10 why? // Problem 1343. Fairy Tale 15 Oct 2015 18:01 What the 10th test? Spatarel Dan Constantin To admins [1] // Problem 1343. Fairy Tale 19 Apr 2014 15:06 I just submitted the same code with: * G++ 4.7.2 C++11 (5626316) and got WA3 * Visual C++ 2010 (5626319) and got AC Can you please tell me what works wrong when compiling with G++? Thank you ...†.†.†... Stigius ...†.†.†... Re: To admins // Problem 1343. Fairy Tale 20 Apr 2014 13:13 %lld works as %d when you use it in g++ in windows. You should use %I64d instead. grandvic What`s test 1??? [1] // Problem 1343. Fairy Tale 26 Mar 2011 01:39 invokerj Re: What`s test 1??? // Problem 1343. Fairy Tale 6 Dec 2013 08:14 ALSO WA1 ,, simida Smilodon_am [Obninsk INPE] If you have WA 7 // Problem 1343. Fairy Tale 2 Mar 2013 19:12 Test #7 contain data as follows 11 00000000000 Answer is, for example 000000000003 (thank to Dmitry 'Diman_YES' Kovalioff ) Edited by author 02.03.2013 19:14 ibra (TNU) Ужаснейшее условие // Problem 1343. Fairy Tale 19 Sep 2012 02:34 1) число может быть с ведущими нулями 2) выводить надо с ведущими нулями(если они есть) короче вот тест 1) 0 000000000002 2) 2 02 020000000089 Fat Peter I got TLE on test9.who can tell me how to solve it? [17] // Problem 1343. Fairy Tale 23 Feb 2005 07:47 Dmitry 'Diman_YES' Kovalioff Something that might help you (+) [13] // Problem 1343. Fairy Tale 23 Feb 2005 10:37 I doubt there is another way to solve this problem, but to check random suffixes until the prime number is found. As for me, I just used precalc feature to find all the prime numbers less than 1000000, and then tested numbers using this list. My solution gets AC within 0.48 sec. How to check whether the number is prime or not faster? I don't think it is possible here. Miller-Rabin heuristics will obviously fail, because Int64 is not enough to store 24-digit number while modular exponentation. It might be passed, of course, but for what? :) Anyway, some tests for you: 0 923802054017 // 1 1 192380205401 // 12 192380205401 192380205401 // 11 92380205401 923802054017 // 11 00000000000 000000000005 - be careful, I doubt 000000000000 and 000000000001 are ok! // 10 0123456789 012345678923 Vladimir Yakovlev (USU) Re: Something that might help you (+) // Problem 1343. Fairy Tale 23 Feb 2005 15:14 I also generated random suffixes, but check them straightforward in O(sqrt(N)), and gets AC in 0.031. See http://acm.timus.ru/status.aspx?space=1&pos=745502 Fat Peter Re: Something that might help you (+) // Problem 1343. Fairy Tale 26 Feb 2005 09:21 My program will get TLE when L=12,but I suppose that my programs was to slow leads to TLE. Thank you very much. Neumann Miller-Rabin heuristics will obviously fail? I don't think so! [8] // Problem 1343. Fairy Tale 3 Mar 2005 19:05 I used Miller-Rabin heuristics got AC...... You say Int64 is not enough to store 24-digit number Why you have to store 24-digit? In my pro,I think 19-digit is enough... There is a trick to avoid this situation......so one "mod" still take O(1) time...... If you are good at maths,it is not very hard to think out Good luck! Vladimir Yakovlev (USU) Re: Miller-Rabin heuristics will obviously fail? I don't think so! [7] // Problem 1343. Fairy Tale 4 Mar 2005 01:20 Neumann wrote 3 March 2005 19:05 There is a trick to avoid this situation......so one "mod" still take O(1) time...... I know how to mutiply integers up to 2^63 in O(log N) time: // multiply a and b modulo c typedef unsigned __int64 ull; ull Mul(ull a, ull b, ull c) { if (b == 0) return 0; if (b == 1) return a%c; ull d = Mul(a, b/2, c); d = (d+d)%c; if (b%2 == 1) d = (d+a)%c; return d; } But how to do it in O(1) time? Neumann Re: Miller-Rabin heuristics will obviously fail? I don't think so! [6] // Problem 1343. Fairy Tale 4 Mar 2005 10:58 Sorry,I didn't say it clearly...... calc a^n mod b certainly take at least O(logn) time... I meant that calc a*a mod b in O(1) time,although a may as large as 10^13-1,a*a>int64 ... so Miller-Rabin heuristics still work......just like in small cases...... Vladimir Yakovlev (USU) Can you tell how to do it? [5] // Problem 1343. Fairy Tale 4 Mar 2005 22:32 Neumann your email [4] // Problem 1343. Fairy Tale 5 Mar 2005 10:34 Dmitry 'Diman_YES' Kovalioff Enlighten me too, please :) - dimanyes@yahoo.com (-) [1] // Problem 1343. Fairy Tale 5 Mar 2005 11:47 ronobe (aka oberon) And me, please... // Problem 1343. Fairy Tale 5 Mar 2005 20:24 oberon @ verba.com.ua Vladimir Yakovlev (USU) See e-mail in my profile [1] // Problem 1343. Fairy Tale 5 Mar 2005 13:26 Neumann Sent....check your email // Problem 1343. Fairy Tale 5 Mar 2005 20:14 Oleg Strekalovsky [Vologda SPU] Re: Something that might help you (+) [1] // Problem 1343. Fairy Tale 16 Jul 2010 00:21 Dmitry 'Diman_YES' Kovalioff wrote 23 February 2005 10:37 11 As I understand, 000000000000 is not right answer, but 000000000001 is right.00000000000 000000000005 - be careful, I doubt 000000000000 and 000000000001 are ok! Edited by author 16.07.2010 00:22 balandini Re: Something that might help you (+) // Problem 1343. Fairy Tale 13 Jun 2012 15:57 Edited by author 13.06.2012 16:36 Neumann I use random algo // Problem 1343. Fairy Tale 3 Mar 2005 18:45 the expect running time of my algo is O(100*lognlogn)... judge whether a prime for 100 times... In practise, it did run very fast,AC in 0.031sec... Gheorghe Stefan Re: I got TLE on test9.who can tell me how to solve it? [1] // Problem 1343. Fairy Tale 7 Mar 2005 15:36 I used a simple idea: read N, put zeroes to fill up to 12 digits and then increase these new digits until N is prime... worked with __int64 from Visual C++ Smilodon_am Re: I got TLE on test9.who can tell me how to solve it? // Problem 1343. Fairy Tale 15 May 2010 13:25 Excellent idea. I have used it and got AC. Another good test: 11 00000000001 Ans: 000000000011 Edited by author 15.05.2010 13:26 Inomjon Egamov sayt ishtirokchilariga omad [1] // Problem 1343. Fairy Tale 24 Nov 2011 20:19 masalalarni ishlab charchamaylar Davrbek Tursunmurodov Re: sayt ishtirokchilariga omad // Problem 1343. Fairy Tale 3 Jan 2012 10:55 charchamaymiz Gio Pataraia [Tbilisi SU] output limit exeeded in test 10 [1] // Problem 1343. Fairy Tale 14 Jun 2011 16:48 can someone give me the test? or some hints ? Gio Pataraia [Tbilisi SU] Re: output limit exeeded in test 10 // Problem 1343. Fairy Tale 14 Jun 2011 22:09 now ok i got ac, i've forgotten to foreseee when n = 0; Roshka plzzz can anybody give me the 7th test? [1] // Problem 1343. Fairy Tale 4 Dec 2008 05:48 Yegor Stepanov Re: plzzz can anybody give me the 7th test? // Problem 1343. Fairy Tale 5 Oct 2010 21:30 Try something like 2 00 or 3 001 ;) OpenGL Mistake in statement [1] // Problem 1343. Fairy Tale 2 Jul 2009 19:18 In russian wrong: "От ударов, щит разлетается на куски, ..." Right: "От ударов щит разлетается на куски, ..." Sandro (USU) Fixed (-) // Problem 1343. Fairy Tale 3 Jul 2009 03:00 SkorKNURE Java BigInteger.nextProbablePrime() works [3] // Problem 1343. Fairy Tale 4 Dec 2008 04:44 funny Fyodor Menshikov Re: Java BigInteger.nextProbablePrime() works [2] // Problem 1343. Fairy Tale 5 Dec 2008 03:28 Why it shouldn't? Numbers are _so_ small that "probable" prime turns into "exactly" prime. RASTA Re: Java BigInteger.nextProbablePrime() works [1] // Problem 1343. Fairy Tale 19 Apr 2009 16:39 now it write Restricted function:) Vladimir Yakovlev (USU) Re: Java BigInteger.nextProbablePrime() works // Problem 1343. Fairy Tale 29 Apr 2009 02:23 For several reasons the calls of nextProbablePrime and isProbablePrime functions leads to Restricted function verdict on Java 6 Alexander Kouprin ??!?!??!!?? (-) [1] // Problem 1343. Fairy Tale 23 Mar 2007 03:12 I got WA#10 on this: readln(n); readln(z); for i:=1 to 12-n do z:=z*10; repeat test; z:=z+1; until false; end. AND WHAT? I got AC on this: read(n); read(z); for i:=1 to 12-n do z:=z*10; repeat test; z:=z+1; until false; end. BUT! "В первой строке находится число уже ушедших Месяцев. Во второй — названные ими числа." So, in test 10 all numbers placed in first line? Or what?.. It's ANFAIR! ;) bsu.mmf.team Re: ??!?!??!!?? (-) // Problem 1343. Fairy Tale 18 Oct 2008 18:14 In Test #10 n=0 - that's why your programme returns WA KRSU 2 Can the first number be zero? [2] // Problem 1343. Fairy Tale 19 Feb 2005 16:12 Can the first number be zero? And if so what we should do then? ФерПИ_3 Re: Can the first number be zero? [1] // Problem 1343. Fairy Tale 19 Feb 2005 16:27 write a new program and send again Olympic Bear (Nikolay Dubchuk) Re: Can the first number be zero? // Problem 1343. Fairy Tale 10 May 2008 22:25 n = 0 in test #10, and don't forget write leading zeroes of your answer Edited by author 10.05.2008 22:27 Todor Tsonkov Question [1] // Problem 1343. Fairy Tale 15 Aug 2006 15:15 If the input is 0 is 000000000003 correct answer ? PSV Re: Question // Problem 1343. Fairy Tale 22 Mar 2007 21:48 Yeap Safe Bird (+)Admins [13] // Problem 1343. Fairy Tale 2 Feb 2006 22:10 it is interesting for this problem, that readln/writeln int64 in pascal always fails??!!?? writeln(int64) fails on case 7 readln(int64) fails on case 10. what kind of pascal compiler do you use?(along with version number) thank you very much Dmitry 'Diman_YES' Kovalioff As far as I know, FreePascal 2.03 or smth like that ;) (-) // Problem 1343. Fairy Tale 2 Feb 2006 23:33 Dmitry 'Diman_YES' Kovalioff P.S. (+) [1] // Problem 1343. Fairy Tale 2 Feb 2006 23:39 I personally invite you (and everyone who is reading this message ;] ) and your team Shangri-La to participate in Timus Top Coders: First Challenge, see http://acm.timus.ru/contest.aspx?id=46 . Safe Bird (+)yes, we will come // Problem 1343. Fairy Tale 4 Feb 2006 21:40 there are three "shangri-la"s in the past since i have two different teammates each year, and.. i just found two members, i think they will come with me:) Vladimir Yakovlev (USU) Re: (+)Admins [8] // Problem 1343. Fairy Tale 3 Feb 2006 15:22 You can't use readln(int64) and writeln(int64) in this problem. It's your mistake. ACM.Krupko_Victor[Ivanovo SPU] Re: (+)Admins [7] // Problem 1343. Fairy Tale 4 Feb 2006 00:53 thanx safe bird but why i can't use readln(int64) and writeln(int64) in this problem? Vladimir Yakovlev (USU) Re: (+)Admins [6] // Problem 1343. Fairy Tale 4 Feb 2006 14:31 because of leading zeroes Safe Bird (+)But... [5] // Problem 1343. Fairy Tale 4 Feb 2006 21:42 i know why writeln fails not. but... why do "readln(int64)" fail on it? isn't "001234" read as "1234" by readln? Vladimir Yakovlev (USU) No comments :) [4] // Problem 1343. Fairy Tale 4 Feb 2006 22:26 Safe Bird I don't think it is a tricky case [3] // Problem 1343. Fairy Tale 4 Feb 2006 22:46 the C++ program that "read(int64)" gets AC but the Pascal program that "read(int64)" gets wrong answer on 10:( Vladimir Yakovlev (USU) read(int64) fails on test with empty second line [2] // Problem 1343. Fairy Tale 4 Feb 2006 23:54 Edited by author 04.02.2006 23:55 Safe Bird god... [1] // Problem 1343. Fairy Tale 5 Feb 2006 00:13 ACM.Tolstobrov_Anatoliy[Ivanovo SPU] to Safe Bird... // Problem 1343. Fairy Tale 5 Feb 2006 02:13 to Safe Bird Var t:Int64; Begin ReadLn(t); WriteLn(T); ReadLn; End. Input 10^10 And What You See For Screen? On My Delphi7 i See 10^10 currently unnamed... Re: (+)Admins // Problem 1343. Fairy Tale 30 Mar 2006 21:44 The first number seems to be 0 on test 10...
|