Re: [gcj] Wrong Answer with Problem- The Trip

How to submit code to that shit site? This Java code seems to work, but I don't know how to submit there: package org.onlinejudge.uva; import java.io.File; import java.io.PrintWriter; import java.util.Scanner; public class ATheTrip { static Scanner in; static PrintWriter out;

Re: [gcj] Re: Round 1A 2012 - Problem B

Thanks a lot zach!!! :) On Mon, Apr 15, 2013 at 10:30 PM, zach polansky zacharypolan...@gmail.comwrote: 0 51 4 0 1 2 1 1 3 4 7 6 5 6 5 Hope this is understandable -- You received this message because you are subscribed to the Google Groups Google

Re: [gcj] questions about rounds and structure

Can I participate in rounds 2 and 3 if I fail in 1abc? I know that I will not be able to advance for the subsequent rounds, but it would be cool if I could at least participate. =D On Tue, Apr 16, 2013 at 11:32 AM, Carlos Guia carlos.guia.v...@gmail.comwrote: Yes you can Carlos Guía On

Re: [gcj] Re: Bull's Eye - Large

Thank you Kannapan. I tested with 1.4 and 1.6 and both worked. 1.0 does't work. I also tested the code without the first condition, but it's necessary to make it work. On Sat, Apr 27, 2013 at 4:42 PM, Kannappan deshka...@gmail.com wrote: the 1.5 might just be to speed up the process to get the

Re: [gcj] Re: Bull's Eye - Large

Thank you Bas and Samuel. Thanks a lot Raj and Álvaro. Now I understand the formula. =) On Sun, Apr 28, 2013 at 7:08 PM, Leandro Coutinho lescoutinh...@gmail.comwrote: Thank you Kannapan. I tested with 1.4 and 1.6 and both worked. 1.0 does't work. I also tested the code without the first

[gcj] Better samples please

The small dataset should test if the coder didn't hard coded the solution. The large dataset should test if the algorithm is efficient enough. So if the solution is not hard coded and could solve the sample, it should be able to solve the small dataset at least. It's very frustrating when the

Re: [gcj] Better samples please

...@gmail.com wrote: there may be many edge cases which is not covered in sample, but we need to take care it. Regards, *Niraj Kumar* B.Tech. CSE Class of 2012 ISM, Dhanbad 8274952350 On Sun, May 5, 2013 at 12:11 AM, Leandro Coutinho lescoutinh...@gmail.com wrote: The small dataset

Re: [gcj] Better samples please

, May 5, 2013 at 12:11 AM, Leandro Coutinho lescou...@gmail.com wrote: The small dataset should test if the coder didn't hard coded the solution. The large dataset should test if the algorithm is efficient enough. So if the solution is not hard coded and could solve the sample

Re: [gcj] Re: Commented Source Code together with Contest Analysis

Good points Stanislav! But there's one point here. They already provide solution sometimes in Python! So they could keep posting solutions in this language or C++ or Java, cause it's what the majority of people here uses, and because one that programs in one of these languages is able to undestand

Re: [gcj] Re: Commented Source Code together with Contest Analysis

Hi bigonion, thanks for sharing your thoughts, but I didn't make this post to discuss what approach is better. It's a very simple issue. They already have a solution, because they needed to prove that's possible to solve the problem, so they could simply attach their solution to the contest

Re: [gcj] hai to all

Hello, Reading the problem ( http://community.topcoder.com/stat?c=problem_statementpm=12540rd=15498), I think it's like this: - Maximum # deer that have two antlers: it's when whenever possible each deer lost two antlers: q = k / 2, r = k mod 2, max = N - q + r - Minimum # deer that have two

Re: [gcj] hai to all

seem to be taking about the div 2 one. Based only on the class names provided in the posts. Carlos Guia On May 11, 2013 9:43 PM, Leandro Coutinho lescoutinh...@gmail.com wrote: Hello, Reading the problem ( http://community.topcoder.com/stat?c=problem_statementpm=12540rd=15498), I think it's

Re: [gcj]

Change the logic. Look at eatmore solution. Em 13/05/2013 08:03, Vaibhav Tulsyan wittynwise2...@gmail.com escreveu: I solved the problem in Java. My logic to solve the 'Consonants' problem is as follows: 1. Find all possible substrings from the name of length 'n' or greater (using substring(

Re: [gcj] CodeShare (Website Idea / feedback would be great)

Hi. there are already other sites for this. But if you think it will be different, go ahead. Em 11/07/2013 14:07, Chris Dorman cdorm...@gmail.com escreveu: hey, I have been working on a long time dream that I have been having. Its called CodeShare. A website where everyone can share there code

Re: [gcj] 2013 Finals analysis published

on that kind of information, even if it isn't terribly exciting. Sorry! Bartholomew On Fri, Sep 6, 2013 at 5:11 PM, Leandro Coutinho lescoutinh...@gmail.comwrote: Hi Petr. Could you answer my question here, please? https://groups.google.com/forum/#!topic/google-code/36wJvrplduQ Maybe

Re: [gcj] Re: Code performance concerns

Nice tips *@Stanislav.*Thank you. On Thu, Apr 3, 2014 at 12:41 PM, Stanislav Zholnin stanislav.zhol...@gmail.com wrote: I would like also to add that I often use the following tactics: Very often for small input much easier algorithm / implementation does the trick. Sometimes you can even

Re: [gcj] Deceitful War

People can't help you here. This problem is about finding the strategy for both War and Deceitful. If someone explain to you why it's 8, then he would be telling you the strategy. =) On Sat, Apr 12, 2014 at 2:26 PM, Angel Java Lopez ajlopez2...@gmail.comwrote: Regarding:

Re: [gcj] Deceitful War

Naomi went to the dark side. Now she is a corrupted person... Em 13/04/2014 11:06, Luke Pebody l...@pebody.org escreveu: Ken is very trusting. Sent from my iPad On 13 Apr 2014, at 12:51, Richard Braakman gta...@clueonic.net wrote: To get 8, Naomi takes 0.300, 0.389, 0.557, 0.832, 0.899,

Re: [gcj] Re: There should be a way to connect with other participants

Really?! Where are you from? :) Em 15/04/2014 15:21, Stanislav Zholnin stanislav.zhol...@gmail.com escreveu: I don't think that there is need for messaging system. But probably there should be some very simple profile page where you can look at City / Country / e-mail or better link to

Re: [gcj] Qualification Round Contest Analysis

I agree Alex. By the way it should be something they already had before the contest start, and they probably have, so I don't understand why not disclose. On Thu, Apr 24, 2014 at 6:50 PM, Alex Polozov polozov.a...@gmail.comwrote: By the way, one could argue that such a delay diminishes the

Re: [gcj] Re: Minesweeper backtracking approach

Thanks a lot for sharing Emil. Nice code. On Fri, Apr 25, 2014 at 8:02 AM, Emil Maskovsky emil.maskov...@gmail.comwrote: Hi, I think I implemented it nearly the same way as they describe it - look for my username styryx in the results panel or see the code here:

Re: [gcj] Problem A

Interesting someone that isn't a programmer professionally and like this stuff. On Mon, Apr 28, 2014 at 10:49 AM, Stanislav Zholnin stanislav.zhol...@gmail.com wrote: I think emotionally being in the middle (definitely not novice, but too far from top performers) is very difficult. On one

Re: [gcj] Any thoughts about the rules?

I would like if the problems analyses had attached a working solution for newbies, with lots of comments. =D Em 08/10/2014 19:46, Bartholomew Furrow fur...@gmail.com escreveu: Hey Code Jammers, It's the time of year where we're revisiting the rules from 2014 to see what we want to change for

Re: [gcj] Submission of Files

search google for a java file tutorial. you can use scanner and printwriter Em 10/04/2017 00:07, "Abhishek Pal" escreveu: > Okay. So I have programmed in java. Now the problem I'm facing is that my > program takes input directly from user and prints the output.

Re: [gcj] Problem D Fashion Show

Ok. But I think the sentence is wrong (or at least very misleading). Maybe it should be: The middle row has a pair of models (x and o) that does not include a + *in their columns*. On Wed, Apr 12, 2017 at 7:04 PM, Luke Pebody wrote: > Yes, but of any two models on a row or

Re: [gcj] Problem D Fashion Show

to not be a + > On Wed, 12 Apr 2017 at 23:29, Leandro Coutinho <lescoutinh...@gmail.com> > wrote: > >> Ok. But I think the sentence is wrong (or at least very misleading). >> >> Maybe it should be: >> >> The middle row has a pair of models (x and o) th

Re: [gcj] wrong output submitted

nice idea. they could check if it is the same output and same source file from a failed attempt, assuming it would be easy for them to check this. On Thu, Apr 13, 2017 at 4:30 PM, Bartholomew Furrow wrote: > Is it possible for google to reject submissions if the answers are

Re: [gcj] Re: What stumped people in Stable Neigh-bors

which I think should not be the case. large should be about efficience, not about extra edge cases. Em 24/04/2017 04:14, "Xiongqi ZHANG" escreveu: > Sometimes you are given a relative weak test cases for small. > In such cases, people get 'Correct' verdict for their

Re: [gcj] Round 1s are over, see the scoreboard and analysis of 1C

thanks pablo and code jam team for making the analyses available so fast. Em 30/04/2017 13:20, "'Pablo Heiber' via Google Code Jam" < google-code@googlegroups.com> escreveu: > Hi, > > With the end of Round 1C, our Round 1 month comes to a close. > Congratulations to the 3000 people that advanced

Re: [gcj] Parenting Partnering: Analysis

Thanks a lot Paul and Abhishek! =) On Tue, May 2, 2017 at 2:28 AM, Abhishek Nanda wrote: > C (0-720) and J(720-1440) is two exchanges, one at time 0 and another at > time 720. The exchange at time 0 is the same as the exchange at time 1440 > depending on which day you

Re: [gcj] The Qual Round is over!

your program will finish or not if it was not actually run? > On Sun, Apr 8, 2018 at 12:56 PM Leandro Coutinho <lescoutinh...@gmail.com> > wrote: > >> Good point. >> >> They should let us know if the program finished on time. They can do this >> without saying

Re: [gcj] The Qual Round is over!

the Interactive problem for 100 > inputs takes more than 10 seconds. > > Cheers, > Bartholomew > > On Sun, Apr 8, 2018 at 2:08 PM Leandro Coutinho <lescoutinh...@gmail.com> > wrote: > >> Hmm good point. >> >> So CodeJam is worst now. >> >>

Re: [gcj] The 2018 Qual Round has started!

Trouble Sort: i < len(L)-2; Shouldn't it be (L) - 3 ?? Index out of bound ?!!! On Fri, Apr 6, 2018 at 8:04 PM, 'Ian Tullis' via Google Code Jam < google-code@googlegroups.com> wrote: > Hi Everyone, > > The Qualification Round has > officially begun! > >

Re: [gcj] The 2018 Qual Round has started!

ops. sorry. forget it On Sat, Apr 7, 2018 at 11:18 AM, Leandro Coutinho <lescoutinh...@gmail.com> wrote: > Trouble Sort: > > i < len(L)-2; > > Shouldn't it be (L) - 3 ?? Index out of bound ?!!! > > On Fri, Apr 6, 2018 at 8:04 PM, 'Ian Tullis' via Google Code Jam &l

[gcj] Re: C++, Parenting Partnering Returns, Qualification Round 2020. Help to find out the cause for fault!!!

Does your code print the answer in the original order? On Monday, April 6, 2020 at 9:45:39 PM UTC-3, Olena Lizina wrote: > > Hi all, > > I didn't pass the Qualification Round 2020 because stuck with Parenting > Partnering Returns. > My solution passes the Sample test cases, but failed on the