| ENG RUS | Timus Online Judge |
Обсуждение задачи 1483. Настольный футболandreyDagger Strange approach [1] // Задача 1483. Настольный футбол 25 фев 2022 22:50 It's obvious that answer for first team is n - 1 How to get answer for second team. Of course total number of points do not exceed 3 * (n * (n - 1) / 2), because we played n * (n - 1) / 2 matches, and in every match summary points not exceed 3. Assume looser team got k points, that mean that total number of points >= k * n. But k * n can't be greater than 3 * n * (n - 1) / 2, so: k * n <= 3 * n * (n - 1) / 2, then k <= 3 * (n - 1) / 2. Answer is 3 * (n - 1) / 2. Apkawa Re: Strange approach // Задача 1483. Настольный футбол 8 июн 2022 21:18 But how to prove that we can make such competition where k is the smallest value and we have (n - 1) values that are not less? Edited by author 08.06.2022 21:21 THE_SCORPION what is the answer for n=3 and n=4? [6] // Задача 1483. Настольный футбол 7 окт 2006 16:26 subj Kaliningrad SU -J_A_MES-HeadLiner Re: what is the answer for n=3 and n=4? [5] // Задача 1483. Настольный футбол 7 окт 2006 16:28 Good question. Unreal problem ..?? THE_SCORPION Re: what is the answer for n=3 and n=4? [4] // Задача 1483. Настольный футбол 7 окт 2006 16:35 Yes...please help me Alexander Sokolov [MAI] Re: what is the answer for n=3 and n=4? // Задача 1483. Настольный футбол 7 окт 2006 16:50 n==7 9 9 is this correct? tester Re: what is the answer for n=3 and n=4? [2] // Задача 1483. Настольный футбол 7 окт 2006 20:20 3>> 2 3 4>> 3 4 15>>14 21 Edited by author 07.10.2006 20:21 David Tvaltchrelidze Re: what is the answer for n=3 and n=4? [1] // Задача 1483. Настольный футбол 21 дек 2006 16:52 if all matches finish with draw, all teams must have n-1 points. If there are 3 teams answer is 2 2. Is it true?? Piratek-(akaDK) Re: what is the answer for n=3 and n=4? // Задача 1483. Настольный футбол 12 авг 2008 13:52 David Tvaltchrelidze писал(a) 21 декабря 2006 16:52 if all matches finish with draw, all teams must have n-1 points. No correct Answer for 3 is 2 3If there are 3 teams answer is 2 2. Is it true?? because if 1 win 2 if 2 win 3 if 3 win 1 they all have 3 points Kaliningrad SU -J_A_MES-HeadLiner To Authors! [1] // Задача 1483. Настольный футбол 7 окт 2006 16:33 Osliki and T34 must get min and max simultaneously in one game? Denis Koshman Re: To Authors! // Задача 1483. Настольный футбол 27 июл 2008 00:05 No BigBin Hint for this problem // Задача 1483. Настольный футбол 25 июл 2008 14:16 You must know score of Ural SU Osliki and Ural SU T34 team is not simultaneously in one game. For the first team. If they play all game with draw so the winner have n-1 scores. For the second team. The best scores is all team is win in n/2 games so the second team have (n-1)/2*3 scores but if n is even so it have one game for draw. for n is even = (n-1)/2*3 + 1 for n is odd = (n-1)/2*3 *sorry for bad english SPIRiT The algo is easy, but the idea is not quite...(-) [7] // Задача 1483. Настольный футбол 9 окт 2006 17:02 svr Re: The algo is easy, but the idea is not quite...(-) [6] // Задача 1483. Настольный футбол 10 окт 2006 00:55 I have Ac(0.015) by diagonal sequantal placing nambers 1..N*N from max and min alternating 25 2 22 6 2 17 1 23 5 18 10 24 4 19 9 14 3 20 8 15 12 21 7 16 11 13 but clear mathamatic proof i don't now and this is most interesting. I will try find out such proof and if people will have interest will send this proof to forum. Without proof algotithm hasn't hard foundation. Michael_Rybak That would be interesting, I'm also trying to prove it. (-) // Задача 1483. Настольный футбол 10 окт 2006 17:46 - Alexey Re: The algo is easy, but the idea is not quite...(-) [4] // Задача 1483. Настольный футбол 17 окт 2006 13:50 So, what is your algo, svr? After building your matrix, what are you doing? Thanks. Edited by author 17.10.2006 13:53 svr Re: The algo is easy, but the idea is not quite...(-) [3] // Задача 1483. Настольный футбол 17 окт 2006 14:08 If we have optimal matrix to take answer is very simple problem. We use double loop, calculate sums A[i,j]+A[i-1,j] and A[i,j-1]+A[i,j] and renew record value searching max. [SPbSU ITMO] MAKAPOB Idea is very easy for this problem! [2] // Задача 1483. Настольный футбол 11 мар 2007 03:40 First number is always : (n - 1). Second if n even => 3 * ((n - 2) / 2) + 1 If n odd => 3 * ((n - 1) / 2) Tural Neymanov Yes, idea is realy very easy! // Задача 1483. Настольный футбол 11 янв 2008 22:16 Yes, I have also maden by this way. My program is in 7 lines(without var,begin,end - 3). But I don'y understand why it works in 0.015, except 0.001. I used only 1 read and if. strange isn't it? Temp Re: Idea is very easy for this problem! // Задача 1483. Настольный футбол 24 фев 2008 13:21 what is answer if n=8 when only one match with win&lose ,and other is draw answer should be 6 9 (6(1)+3)? Edited by author 24.02.2008 13:21 Edited by author 24.02.2008 13:21 Player Help [6] // Задача 1483. Настольный футбол 7 окт 2006 15:43 Could someone please post the output for n=4 ? Cause the problem is not very specific. All matches could be draws and then... But it appears that's not possible. Why not? Ivan Filatov (OrenburgSU) Re: Help [5] // Задача 1483. Настольный футбол 7 окт 2006 15:49 3 3 or not? Player Re: Help [4] // Задача 1483. Настольный футбол 7 окт 2006 15:54 I don't think so. That's like asuming all matches are draws. I've tried this solution and it doesn't work. Yevgeniy Re: Help // Задача 1483. Настольный футбол 7 окт 2006 16:05 maybe 6 3 Shayan Ehsani Re: Help [2] // Задача 1483. Настольный футбол 7 окт 2006 16:06 n==4 4 3 But we got WA 3 !! Seyyed Mehran Kholdi Re: Help // Задача 1483. Настольный футбол 22 янв 2008 14:51 Please read the statement of the problem; you have to determine the MAXIMUM points of team2 and MINIMUM point of team 1. Edited by author 22.01.2008 14:53 Seyyed Mehran Kholdi Re: Help // Задача 1483. Настольный футбол 22 янв 2008 14:51 Edited by author 22.01.2008 14:51 awpris The shortest program [1] // Задача 1483. Настольный футбол 10 янв 2007 00:22 All results 0:0? Ok? :) Roma Labish[Lviv NU] NO(-) // Задача 1483. Настольный футбол 10 янв 2007 01:03 Kaliningrad SU -J_A_MES-HeadLiner ??? [1] // Задача 1483. Настольный футбол 7 окт 2006 16:27 Can first number <> second number? I can't understand this task )= PSV Re: ??? // Задача 1483. Настольный футбол 28 ноя 2006 21:19 why output n-1 twice isn't right? Daniel n = 1 [5] // Задача 1483. Настольный футбол 7 окт 2006 14:50 if n=1, the answer should be 0 0 or not? Player Re: n = 1 [4] // Задача 1483. Настольный футбол 7 окт 2006 14:56 Theoretically yes. But the problem statement says that the teams Osliki and T34 are participating. That's 2 teams. Vladimir Yakovlev (USU) Osliki and T34 could be the same team =) [3] // Задача 1483. Настольный футбол 7 окт 2006 14:57 Player Re: Osliki and T34 could be the same team =) [2] // Задача 1483. Настольный футбол 7 окт 2006 14:58 Ok. Thanks. Igor Goroshko Re: Osliki and T34 could be the same team =) [1] // Задача 1483. Настольный футбол 7 окт 2006 15:26 Can they all play draw??? Ivan Filatov (OrenburgSU) Re: Osliki and T34 could be the same team =) // Задача 1483. Настольный футбол 7 окт 2006 16:04 Теоретически да. ) Player Problem D // Задача 1483. Настольный футбол 7 окт 2006 14:50 Can N be 1? Shouldn't be at least 2 teams?
|