ENG  RUSTimus Online Judge
Online Judge
Задачи
Авторы
Соревнования
О системе
Часто задаваемые вопросы
Новости сайта
Форум
Ссылки
Архив задач
Отправить на проверку
Состояние проверки
Руководство
Регистрация
Исправить данные
Рейтинг авторов
Текущее соревнование
Расписание
Прошедшие соревнования
Правила
вернуться в форум

Обсуждение задачи 1688. Team.GOV!

sum must be stongly greater than n, or can be equal to leave the team?
Послано partisan 28 фев 2009 14:16
Re: sum must be stongly greater than n, or can be equal to leave the team?
Послано chenyichen 28 фев 2009 14:36
the same question
sum must be stongly greater than n, or can be equal to leave the team?
Послано partisan 28 фев 2009 14:40
YES (Just got AC)
Re: sum must be stongly greater than n, or can be equal to leave the team?
Послано Li Cheng 28 фев 2009 16:17
I don't know how partisan can get AC
In fact, sum(cost1+cost2+...) should be strongly greater than n*3
Re: sum must be stongly greater than n, or can be equal to leave the team?
Послано Ilya (Vologda SPU) 28 окт 2009 00:39
YES! STRONGLY GREATER ONLY!!!
If you'll use >=, you get WA#3 or smth like that >_<
I wish them publish more EXACT problem situations... >_>
Re: sum must be stongly greater than n, or can be equal to leave the team?
Послано Andros 11 июн 2014 12:00
It says here: "the money Vadim had paid for him exceeded n rubles"

Since I automatically just thought it had to be only greater or equal to N (because that sounds way more logical), I got WA at test #3 and I had no idea why.

This is a programming problem, not a reading one - I think there should be more emphasis on the difficulty of *making the solution*, not on understanding the text and looking for small details hidden between hundreds of words. I know the task is very easy, but that doesn't mean making the statement look more complicated will balance things out.

Of course, I wouldn't mind a long statement, as long as there is a recap of everything at its end. For example, something like "For a given integer N(1<=N<=2*10^9), integer M(0<=M<=3000) and M integers a[1,2...M] (1<=a[i]<=2*10^6 inclusive), print the index i for which (a[1]+a[2]+...+a[i])/3 > N. If there is no such index, print "Team.GOV!""