; knowing the
standard existing techniques
-> Solve a few problems after learning each of them
-> Keep practicing and participating regularly (doesn't take lot of time at
all ) in matches like this.
- Anil Kishore.
On Fri, Sep 4, 2009 at 10:58 PM, David M. wrote:
> I feel the same
Hi sagar, I have not read CLRS (yet ;)) and in fact no other
math books. But, felt that I may be missing something and to get interest in
all this, I've taken Masters ;) and I HAVE to read now :(. Our Prof. is
following 'Kenneth Rosen' for Discrete Maths, which is a good book, with lot
Hmm.. looks fine. Take care of 'next()' and 'nextLine()' of the Scanner
class and try out a few things. Also, initialize two strings with the path
to directories of input and output files, if needed. Also, you may prepare a
small template to take number of test cases, put a loop and print 'Case #x:
not needed).
May be someone who can solve advanced DP in less time, can explain better.
- Anil Kishore
On Thu, Sep 10, 2009 at 1:41 PM, amit jain wrote:
> okk
> how do you think optimal substructure step ?
> On Thu, Sep 10, 2009 at 1:34 PM, Hawston LLH wrote:
>
>> i guess on
You may wanna try the Problem in Todays TopCoder SRM ,
http://www.topcoder.com/stat?c=problem_statement&pm=10620
<http://www.topcoder.com/stat?c=problem_statement&pm=10620>Its a good
problem. Give it a try :) ,, Don't worry, we are there to explain in case.
- Anil Kishore,
Ya, you can open the full scoreboard, by clicking the same in left panel,
thats showing top scorers. In the full score board, you have a checkbox at
top, 'solution download', you can checkin that and can download.
If you want to download a specific language, you can try here
http://www.go-hero.net/
There is no such function inbuilt in Java. But you can write one easily..
and save it for reference for these type of contests. You may wanna look at
this, http://forums.sun.com/thread.jspa?threadID=389012&tstart=85500 , the
class 'Perm' in one of the posts, implements it neatly.
Cheers,
- AK
On
Hmm, ya.. but something like that would be explicitly mentioned. All the
changes from the normal system is mentioned in the question. No assumptions
to be made :)
nice question btw, which planet are you from ? :p
- AK
On Sun, Sep 13, 2009 at 6:45 PM, Damien Wintour wrote:
>
> minor point and ir
int is 4 bytes and long is 8 bytes.. and, we know that 'int' a
little(relatively) more than 2x10^9 and 'long' is a little more than 9x10^18
and in the constraints, its specifically mentioned that "The answer will
never exceed 1018" , so long will do... and make sure that the arithmetic in
between i
If 'm not wrong, You can view the problems during the contest, but cann't
submit them during contest time. It will be opened for practice, just a
while after the contest ends, and you can submit then.
- AK
On Mon, Sep 14, 2009 at 1:26 PM, Seedrick wrote:
>
> I have not qualified for Online Round
Hi Ken, No need for BigInteger for this problem. The answer is
guaranteed to be <=10^18, a 'long' will work fine. Also, long long in c++ is
same like 'long' in Java, it is also 64bits. We just need to take care that
all other arithmetic is also done on longs.
- AK
On Mon, Sep 14, 2009 a
Hi,Now I see that the round-2 is scheduled for Saturday, 26th September.
I remember it was on 19th Sep before, or am i wrong ?
So, it is shifted by a week now. What could be the reasons ? .. finding
cheaters in qualification round and all sub round-1s ?
- AK
--~--~-~--~~--
I prefer to win a T-shirt next year !
On Sun, Sep 27, 2009 at 1:32 PM, Mikhail Dektyarev <
mihail.dektya...@googlemail.com> wrote:
> I vote for 3001 to get it:)
>
> On Sun, Sep 27, 2009 at 11:53 AM, liang yu wrote:
>
>> I prefer all the 3000:)
>>
>>
>> On Sun, Sep 27, 2009 at 3:50 PM, Huy Phan
This works ?
while( scanf("%d",&N)!=EOF )
-AK
On Thu, Oct 1, 2009 at 11:52 PM, kumaran arumugam wrote:
> https://iws60.iiita.ac.in/alkhwarizm/?page=intro
>
>
> On Thu, Oct 1, 2009 at 11:50 PM, Lev Neiman wrote:
>
>> link to acm judge plz. this problem looks interesting.
>> Sincerely,
>>Lev
"google-codejam" group.
> To post to this group, send email to google-c...@googlegroups.com.
> To unsubscribe from this group, send email to
> google-code+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/google-code?hl=e
For seeing the formatting ( newlines etc., ) better, you may want to
download some good text editors. Notepad may not work for this. I'm using
"notepad++" ,which is open source. If you are on linux, vim or gedit should
be fine.
- AK
On Thu, Apr 8, 2010 at 10:49 AM, joydeep wrote:
> Can you tell
end email to
> google-code+unsubscr...@googlegroups.com
> .
> For more options, visit this group at
> http://groups.google.com/group/google-code?hl=en.
>
--
Anil Kishore
--
You received this message because you are subscribed to the Google Groups
"google-codejam" group.
To
17 matches
Mail list logo
