| ENG RUS | Timus Online Judge |
Discussion of Problem 1349. FarmYongye Look up Fermat's last theorem // Problem 1349. Farm 22 Nov 2020 14:12 Nuff said wnik no solution for n = 2 in network // Problem 1349. Farm 2 Nov 2020 17:37 WHYYYYY if u have same problem solution is 3 4 5 Mescheryakov_Kirill Incorrect example (Неверный пример) [3] // Problem 1349. Farm 9 Nov 2014 17:30 In the measurements it is written that when 1 response 1 2 3. But in the condition said "If there are several solutions, display, where a minimum. If such multiple, display, where the minimum of b and so on". So the correct answer should be 1 1 2. (В промерах написано, что при 1 ответ 1 2 3. Но в условии сказано "Если решений несколько, вывести то, где a минимально. Если и таких несколько, вывести то, где минимально b и т.д". Поэтому правильный ответ должен быть 1 1 2.) Edited by author 09.11.2014 17:33 Vedernikoff 'Goryinyich' Sergey (HSE: АОП) Re: Incorrect example (Неверный пример) [2] // Problem 1349. Farm 9 Nov 2014 18:25 Have you read the statement? "Output Three ***different*** integers (a, b and c) such that..." GastonFontenla Re: Incorrect example (Неверный пример) [1] // Problem 1349. Farm 19 Jan 2016 07:26 Hahaha, Timus should have something like a "Like" button for comments like yours. ;) bstu_student Re: Incorrect example (Неверный пример) // Problem 1349. Farm 22 Aug 2018 17:57 like) Adkham what about Ramanujan's 1729 // Problem 1349. Farm 8 Feb 2018 19:27 I remember once going to see him when he was ill at Putney. I had ridden in taxi cab number 1729 and remarked that the number seemed to me rather a dull one, and that I hoped it was not an unfavourable omen. "No," he replied, "it is a very interesting number; it is the smallest number expressible as the sum of two cubes in two different ways." G.H.Hardy 1729 = 1^3 + 12^3 = 9^3 + 10^3 IlushaMax Hahaha // Problem 1349. Farm 22 Mar 2016 01:52 See on hint in author of the problem. One more hint: Use wiki if you know nothing about Mr. Pierre Edited by author 22.03.2016 02:06 2MMLoser Hint : fermats last theorem [3] // Problem 1349. Farm 1 Nov 2011 15:24 search wikipedia for FERMAT'S LAST THEOREM and you will come to know everything about this problem.(1349 Farm) Edited by author 01.11.2011 15:24 Ealham Al Musabbir Re: Hint : fermats last theorem // Problem 1349. Farm 10 Jun 2015 20:15 Thanks a lot... Evgeny Sibil Re: Hint : fermats last theorem // Problem 1349. Farm 4 Aug 2015 01:19 I have discovered a truly marvellous proof of this, which this margin is too narrow to contain Neeraj Kumar Re: Hint : fermats last theorem // Problem 1349. Farm 2 Jan 2016 15:28 Thanks you are a saviour. I was applying all my mathematics to get those triplets for n > 2. Lega Test for n=1 !!! [5] // Problem 1349. Farm 13 May 2005 19:20 in sample for n=1 -> 1 2 3, solve for n=1 -> 1 1 2 !!! who right? Dmitry 'Diman_YES' Kovalioff Read problem definition carefully - "Three different positive integers". So the sample is correct (-) // Problem 1349. Farm 13 May 2005 19:42 Bruno Croys Felthes Re: Test for n=1 !!! // Problem 1349. Farm 18 Jul 2005 21:55 'a' have to be diferent from 'b' Arthur Garcia Re: Test for n=1 !!! [2] // Problem 1349. Farm 3 Jul 2008 04:05 0 < a < b < c < 101 Egor Re: Test for n=1 !!! [1] // Problem 1349. Farm 7 Nov 2011 20:47 Arthur Garcia wrote 3 July 2008 04:05 0 < a < b < c < 101 There is no such condition in a problem description.Andrew Sboev Re: Test for n=1 !!! // Problem 1349. Farm 23 May 2012 16:13 "Three DIFFERENT integers (a, b and c) such that..." Sirko I have discovered a truly marvelous AC for this, which this margin is too narrow to contain [1] // Problem 1349. Farm 1 Aug 2011 20:18 Aleksa_Markoni Re: I have discovered a truly marvelous AC for this, which this margin is too narrow to contain // Problem 1349. Farm 23 Dec 2011 06:16 Ha Ha Daniyar unfair [1] // Problem 1349. Farm 7 Jul 2011 21:48 why my clever solution is wa5 and my stupid sol is acc? liushujia Re: unfair // Problem 1349. Farm 1 Aug 2011 11:22 +1 M.D.House IT'S SO EASY!!!=)))) [2] // Problem 1349. Farm 12 Aug 2010 20:36 Look at the author's name...))) --------------------------------- Sorry, for my bad English... phizaz Re: IT'S SO EASY!!!=)))) [1] // Problem 1349. Farm 15 May 2011 10:56 Yeah! S.77 Re: IT'S SO EASY!!!=)))) // Problem 1349. Farm 31 Jul 2011 02:31 Oh yeah! I'm so ashamed that I solved it using long ariphmetics at first :( BSoD Typo? [1] // Problem 1349. Farm 19 Aug 2010 00:49 ... Three different *postitve* integers (a, b and c) ... Sandro (USU) Fixed (-) // Problem 1349. Farm 19 Aug 2010 01:36 MILAN There are 3 variants deside. [8] // Problem 1349. Farm 20 Mar 2005 11:08 [Code deleted] I have AC, but I can't prove it. Edited by moderator 02.10.2021 16:15 Dmitry 'Diman_YES' Kovalioff Ferma's Great Theorem... Few can prove it :) (-) [2] // Problem 1349. Farm 20 Mar 2005 13:39 Baurzhan Re: Ferma's Great Theorem... Few can prove it :) (-) [1] // Problem 1349. Farm 7 Nov 2009 20:04 NOBODY can prove it! Elementary proof doesn't known nowadays, only in 1995 some mathematician found complicated evidence (130 pages) of this theorem. Edited by author 07.11.2009 20:07 svr Re: Ferma's Great Theorem... Few can prove it :) (-) // Problem 1349. Farm 7 Nov 2009 20:45 I think that your are right! My opinion is to see on "no elementary" proves as on politic plays of big boys that can't give anything to algorithms and programming. Sergey Baskakov, Raphail and Denis Re: There are 3 variants deside. [1] // Problem 1349. Farm 21 Mar 2005 02:58 Well, I got AC either. And my solution is very similar, the only difference is that I'm using CASE statement (: But I designed my solution being aware of Fermat's last theorem. I would be grateful if you could explain, how you managed to figure out the solution without knowing that theorem. Just by considering some sample situations? Or were you aware of that theorem either? rafailka Maigo Akisame (maigoakisame@yahoo.com.cn) Re: There are 3 variants deside. // Problem 1349. Farm 29 May 2005 12:43 Wouldn't high-precision be fine? FireHeart Re: There are 3 variants deside. [2] // Problem 1349. Farm 19 Nov 2007 21:39 This is "small Fermat theorem" Fermat told that you have no answer if n>=3 Orlangur [KievNU] In this problem (0 ≤ n ≤ 100) (+) // Problem 1349. Farm 20 Nov 2007 16:04 bsu.mmf.team Re: There are 3 variants deside. // Problem 1349. Farm 15 Sep 2008 18:10 No, it's a "Great Theorem of Ferma", and he proved it only for n=4. The all theorem was proved by Andrew Wiles (England) in 1994.
|