[gcj] Re: Fwd: Competency levels

same feeling On Fri, Sep 4, 2009 at 9:59 PM, romanr wrote: > Satyajit Malugu wrote: > > Can you guys share the techniques or the mind set for solving the > problems fastly? > > Some of things I observed so far. > >1. Don't try new languages or techniques. > >actually is not true

[gcj] Re: Subrounds: you have been assigned to all of them

can i change my programming language now? On Wed, Sep 9, 2009 at 9:20 AM, Bartholomew Furrow wrote: > We've decided to allow all contestants to compete in all subrounds of Round > 1 -- unless they qualified for Round 2 in an earlier subround. Good luck to > everyone in Round 1! > *FAQ* > > Q: W

[gcj] Re: Dynamic Programming

u know we have not enough time during competition and sol of dp looks like they will take 1 complete day.. now a days i m spending my whole day to solve a single dp problem like we had in qualification round. and i read out both clrs and as well as topcoder link so plz suggest me useful trick to so

[gcj] Problem in 2008 round 1a problem 3 i.e number

not giving correct result import java.io.*; public class Main { int N,n; int mod=1000; long a[][]; static BufferedReader br; //static Scanner sc; static PrintWriter p; public static void main(String[] args) throws Exception { //sc=new Scanner(new File("C-small-practice.

[gcj] Re: Dynamic Programming

okk how do you think optimal substructure step ? On Thu, Sep 10, 2009 at 1:34 PM, Hawston LLH wrote: > i guess only practice more and get more familiar with it is the only useful > trick if there is any. :) > > On Thu, Sep 10, 2009 at 3:57 PM, amit jain wrote: > >> u kn

[gcj] Re: Dynamic Programming

t the order in which the subproblems are solved . . > -> Aha !, its DP . . I knew it ! :p > > If you are in doubt, you can simply memoize (even if its not needed). > May be someone who can solve advanced DP in less time, can explain better. > > - Anil Kishore > > >

[gcj] Re: Dynamic Programming

; -> Aaah!, i figured out the order in which the subproblems are solved . . >> -> Aha !, its DP . . I knew it ! :p >> >> If you are in doubt, you can simply memoize (even if its not needed). >> May be someone who can solve advanced DP in less time, can explain be

[gcj] Re: Subrounds: you have been assigned to all of them

can i solve each question in any language like 1st in C++ 2nd in Java 3rd in any xyz Language --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-cod

[gcj] Re: Multibase Happiness

can any one prove that Decimal number 3 when represented in binary is happy no? On Sat, Sep 12, 2009 at 3:11 PM, Mahendra Kariya wrote: > @Antoine: can u tell me ur user name on codejam. I would like to see your > code. > Regards, > Mahendra Kariya > http://www.mahendrakariya.blogspot.com > > > On

[gcj] Re: Multibase Happiness

ports is like a war without the killing." > > On Sat, Sep 12, 2009 at 3:55 PM, amit jain wrote: > >> >> can any one prove that Decimal number 3 when represented in binary is >> happy no? >> On Sat, Sep 12, 2009 at 3:11 PM, Mahendra Kariya < >> mahe

[gcj] Re: Dynamic Programming

plz help in dp On Fri, Sep 11, 2009 at 3:29 PM, Octav wrote: > > My apologies, just noticed it was about topcode and not codejam. > > > > --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "google-codejam" group. To p

[gcj] Re: Dynamic Programming

dra Kariya > http://www.mahendrakariya.blogspot.com > > > On Mon, Sep 14, 2009 at 3:14 PM, amit jain wrote: > >> plz help in dp >> >> On Fri, Sep 11, 2009 at 3:29 PM, Octav wrote: >> >>> &g

[gcj] Re: Dynamic Programming

; > Regards, > Mahendra Kariya > http://www.mahendrakariya.blogspot.com > > > On Mon, Sep 14, 2009 at 3:26 PM, amit jain wrote: > >> buddy i read out completely from there and also cormen but it is not >> helping in solving problem like round IC 3rd &

Re: [gcj] Re: 2010 -- What do you think?

hello sir Semester exam of indian universities held in may so plz try to change the dates... preferable dates will be after may... -- You received this message because you are subscribed to the Google Groups "google-codejam" group. To post to this group, send email to google-c...@googlegroups.co

Re: [gcj] modular arithmetic

Thanks Renato for the information. Can you please provide some input on "how to improve on big size data processing "? Any pointer for it is most welcome Thanks -Amit Jain On Mon, Feb 27, 2012 at 5:50 PM, Renato Parente wrote: > a/b % mod = a* (b^-1) % mod > Since mod = 10^

Re: [gcj] Registration for Google Code Jam 2012 is now open!

On Wed, Mar 21, 2012 at 3:38 AM, Bartholomew Furrow wrote: > Fellow problem-solvers and coding enthusiasts, we are excited to announce > that registration for Google Code Jam 2012 is > now open! > > We'll be flying the top 25 contestants to New York City this year t

Re: [gcj] Re: Round 1B 2012 amateur analysis (while we wait for the real one)

with your analysis with the eye of amateur (I thought in this manner for Problem 1) Thanks Amit Jain On Sun, May 6, 2012 at 8:45 AM, tutufan wrote: > I'm thinking that Yui Yu Ho had the key observation on this above. Using > those numbers, I think you can liken this to a Birthday Pa

Re: [gcj] problem with output

No, You should write Case #N: IMPOSSIBLE (Where N is your case number.) On Tue, Jan 22, 2013 at 5:50 PM, mandeep wrote: > If it is impossible to make a profit given the market trends, you should > output IMPOSSIBLE. > > > > On 22 January 2013 17:36, Satyajit Bhadange > wrote: > >> if(min>m)

Re: [gcj] Suggestion About Analysis

+1 On Mon, Jun 27, 2016 at 12:02 AM, Nathan Azaria wrote: > Is it possible to put the contest analysis overview somewhere else, or > just don't post them if the analysis is not available yet? > > Personally, I find it a bit misleading that the link to the analysis page > of round 3 is available